Abstract
In this paper, a multi-objective flexible job shop scheduling problem with machines capacity constraints is studied. Minimizing the makespan and overtime costs of machines are considered as two objectives for evaluating solutions. First, a new nonlinear integer programming model is presented to formulate the problem. Inasmuch as this problem is well-known as a NP-hard problem, a hybrid meta-heuristic algorithm (CFJSP II) is developed to overcome its complexity. Regarding to the solution space of the problem, for assigning and sequencing operations, a multi-objective genetic algorithm based on the ELECTRE method is presented. Also, a powerful heuristic approach to tradeoff the objective functions is developed. Finally, the proposed algorithm is compared with some well-known multi-objective algorithms such as NSGAII, SPEA2, and VEGA. Regarding to the computational results, it is clear that the proposed algorithm has a better performance especially in the closeness of the solutions to the Pareto optimal front.
Similar content being viewed by others
References
Fattahi P, Jolai F, Arkat J (2009) Flexible job shop scheduling with overlapping in operations. Appl Math Model 33:3076–3087
Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117–129
Fattahi P, SaidiMehrabad M, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18:331–342
Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409–425
Al-Hinai N, ElMekkawy TY (2011) Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ 132:279–291
Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369–375
Fattahi P, SaidiMehrabad M, Arynezhad MB (2006) An algorithm for multi objective job shop scheduling problem. J Ind Eng Int 2:43–53
Schaffer JD (1984) Multiple objective optimization with vector evaluated genetic algorithms. PhD thesis, Vanderbilt University, Nashville, TN, USA
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGAII. IEEE Trans Evol Comput 6(2):182–197
Zitzler E, Laumanns M, Theile L (2001) SPEA II: Improving the strength Pareto evolutionary algorithm, Working Paper, Computer Engineering and Networks Laboratory (TIK), Germany
Gao J, Gen M, Sun L, Zhao X (2007) A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Comput Ind Eng 53:149–162
MajaziDelfard V, Mohammadi GH (2012) Two meta-heuristic algorithms for solving multi objective flexible job shop scheduling with parallel machine and maintenance constraints. Comput Math Appl 64:211–2117
Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56:1309–1318
Xing LN, Chen YW, Yang KW (2009) Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl Soft Comput 9:362–376
Li JQ, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multi- objective flexible job-shop scheduling problems. Comput Ind Eng 59:647–662
Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60:245–276
Chiang T, Lin H (2013) A simple and effective evolutionary algorithm for multiobjetive flexible job shop scheduling. Int J Prod Econ 141:87–98
Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manuf Technol 51(5–8):757–767
Moslehi G, Mahnam M (2011) A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int J Prod Econ 129:14–22
Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55(9–12):1159–1169
Wang L, Zhou G, Xu Y, Liu M (2011) An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int J Adv Manuf Technol, 1–13 Article in Press
Moradi E, FatemiGhomi SMT, Zandieh M (2011) Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Expert Syst Appl 38:7169–7178
Zheng Yl, Li YX, Lei DM (2011) Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling. Int J Adv Manuf Technol 1–7 Article in Press
Qing-dao-er-ji R, Wang Y, Wang X (2013) Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm. Appl Soft Comput 13(3):1400–1406
Petrovic D, Duenas A, Petrovic S (2007) Decision support tool for multi-objective job shop scheduling problems with linguistically quantified decision functions. Decis Support Syst 43:1527–1538
Chang PC, Chen SH, Fan CY, Chan CL (2008) Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems. Appl Math Comput 205:550–561
Arroyo JEC, Armentano VA (2005) Genetic local search for multi-objective flowshop scheduling problems. Eur J Oper Res 167:717–738
HusseinzadehKashan A, Karimi B, Jolai F (2010) An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes. Eng Appl Artif Intell 23:911–922
Ning X, Lam KC, Lam MCK (2011) A decision-making system for construction site layout planning. Autom Constr 20:459–473
Azadeh A, Kor H, Hatefi SM (2011) A hybrid genetic algorithm-TOPSIS computer simulation approach for optimum operator assignment in cellular manufacturing systems. J Chin Inst Eng 34(1):57–74
Olcer AI (2008) A hybrid approach for multi-objective combinatorial optimization problems in ship design and shipping. Comput Oper Res 35:2760–2775
Azzam M, Mousa MM (2010) Using genetic algorithm and TOPSIS technique for multi objective reactive power compensation. Electr Power Syst Res 80:675–681
Bojković N, Anić I, Pejčić-Tarle S (2010) One solution for cross-country transport-sustainability evaluation using a modified ELECTRE method. Ecol Econ 69:1176–1186
Almeida A (2007) Multicriteria decision model for outsourcing contracts selection based on utility function and ELECTRE method. Comput Oper Res 34:3569–3574
Aiello G, Enea M, Galante G (2006) A multi-objective approach to facility layout problem by genetic search algorithm and Electremethod. Robot Comput Integr Manuf 22:447–455
Özcan T, Çelebi N, Esnaf Ş (2011) Comparative analysis of multi-criteria decision making methodologies and implementation of a warehouse location selection problem. Expert Syst Appl 38:9773–9779
Kacem I, Hammadi S, Borne P (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern Part C 32(1):1–13
Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35:3202–3212
Roy B (1996) Multicriteria for decision aiding. Kluwer, London
Deb K (2003) Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, Inc. New York, NY, USA
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rohaninejad, M., Kheirkhah, A., Fattahi, P. et al. A hybrid multi-objective genetic algorithm based on the ELECTRE method for a capacitated flexible job shop scheduling problem. Int J Adv Manuf Technol 77, 51–66 (2015). https://doi.org/10.1007/s00170-014-6415-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-014-6415-1