A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems

This study considers the problem of job scheduling on unrelated parallel machines. A multi-objective multi-point simulated annealing (MOMSA) algorithm was proposed for solving this problem by simultaneously minimising makespan, total weighted completion time and total weighted tardiness. To assess the performance of the proposed heuristic and compare it with that of several benchmark heuristics, the obtained sets of non-dominated solutions were assessed using four multi-objective performance indicators. The computational results demonstrated that the proposed heuristic markedly outperformed the benchmark heuristics in terms of the four performance indicators. The proposed MOMSA algorithm can provide a new benchmark for future research related to the unrelated parallel machine scheduling problem addressed in this study.

[1]  Vinícius Amaral Armentano,et al.  Tabu search for scheduling on identical parallel machines to minimize mean tardiness , 2000, J. Intell. Manuf..

[2]  Jeng-Fung Chen.  Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups , 2006 .

[3]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[4]  Clarisse Dhaenens.  A bicriterion approach to deal with a constrained single-objective problem , 2001 .

[5]  John W. Fowler,et al.  Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems , 2011, Comput. Oper. Res..

[6]  Jiaquan Gao,et al.  A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint , 2009 .

[7]  Chiuh-Cheng Chyu,et al.  Optimizing fuzzy makespan and tardiness for unrelated parallel machine scheduling with archived metaheuristics , 2011 .

[8]  Sinan Gürel,et al.  Optimal allocation and processing time decisions on non-identical parallel CNC machines: epsilon-constraint approach , 2007, Eur. J. Oper. Res..

[9]  Dipak Chaudhuri,et al.  Bicriteria scheduling problem for unrelated parallel machines , 1996 .

[10]  Jeng-Fung Chen,et al.  Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints , 2009 .

[11]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  John W. Fowler,et al.  A SURVEY OF ALGORITHMS FOR SINGLE AND MULTI-OBJECTIVE UNRELATED PARALLEL-MACHINE DETERMINISTIC SCHEDULING PROBLEMS , 2004 .

[14]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[15]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[16]  Bharatendu Srivastava,et al.  An effective heuristic for minimising makespan on unrelated parallel machines , 1998, J. Oper. Res. Soc..

[17]  Sinan Gürel,et al.  Discrete Optimization Optimal allocation and processing time decisions on non-identical parallel CNC machines: -constraint approach , 2007 .

[18]  Chung-Cheng Lu,et al.  Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints , 2011 .

[19]  T. B. Tate,et al.  Machine Scheduling Problems , 1978 .

[20]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[21]  Panos M. Pardalos,et al.  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..

[22]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[23]  Giuseppe Lancia,et al.  Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan , 2000, Eur. J. Oper. Res..

[24]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .

[25]  V. Suresh,et al.  Minimizing maximum tardiness for unrelated parallel machines , 1994 .

[26]  Jatinder N. D. Gupta,et al.  Applying multi-start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup times , 2011 .

[27]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[28]  Shih-Wei Lin,et al.  Solving the team orienteering problem using effective multi-start simulated annealing , 2013, Appl. Soft Comput..

[29]  Yang-Kuei Lin,et al.  Unrelated parallel machine scheduling with setup times and ready times , 2014 .

[30]  Chris N. Potts,et al.  Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach , 2005, Eur. J. Oper. Res..

[31]  John W. Fowler,et al.  Scheduling of unrelated parallel machines: an application to PWB manufacturing , 2002 .

[32]  Michele E. Pfund,et al.  Robust scaling parameters for composite dispatching rules , 2010 .

[33]  Chun-Yuan Cheng,et al.  Scheduling unrelated parallel machines to minimize total weighted tardiness , 2003, 2006 IEEE International Conference on Service Operations and Logistics, and Informatics.

[34]  Celso C. Ribeiro,et al.  Multi-start methods for combinatorial optimization , 2013, Eur. J. Oper. Res..

[35]  Shih-Wei Lin,et al.  Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm , 2013, Comput. Oper. Res..

[36]  John W. Fowler,et al.  Multiple-objective heuristics for scheduling unrelated parallel machines , 2013, Eur. J. Oper. Res..