A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling

This paper deals with the problem of scheduling a set of n independent jobs to be processed on m identical parallel machines in order to minimize makespan. This problem is known to be NP-complete. A SA based heuristic is presented to solve this problem. Empirical results with a large number of randomly generated problem instances demonstrate that the proposed method produces solutions that are fairly superior to that of the best-known method in the literature while not affecting its computational effort.

[1]  Shanlin Yang,et al.  A simulated annealing approach to minimize the maximum lateness on uniform parallel machines , 2011, Math. Comput. Model..

[2]  Hyun-Seon Choi,et al.  Scheduling algorithms for parallel machines with sequence-dependent set-up and distinct ready times: Minimizing total tardiness , 2007 .

[3]  Jose A. Ventura,et al.  Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .

[4]  Mostafa Zandieh,et al.  Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm , 2009, Expert Syst. Appl..

[5]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[6]  S.M.T. Fatemi Ghomi,et al.  A pairwise interchange algorithm for parallel machine scheduling , 1998 .

[7]  R. Barton,et al.  Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem , 1997 .

[8]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

[11]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..

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

[13]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[16]  Jatinder N. D. Gupta,et al.  A LISTFIT heuristic for minimizing makespan on identical parallel machines , 2001 .

[17]  Uday Kumar Chakraborty,et al.  An efficient stochastic hybrid heuristic for flowshop scheduling , 2007, Eng. Appl. Artif. Intell..

[18]  Peter Chen,et al.  A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .

[19]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[20]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[21]  Shanlin Yang,et al.  Author's Personal Copy Applied Soft Computing Parallel Machine Scheduling Problem to Minimize the Makespan with Resource Dependent Processing Times , 2022 .

[22]  Purushothaman Damodaran,et al.  A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times , 2012, Expert Syst. Appl..

[23]  Chung-Yee Lee,et al.  Multiprocessor scheduling: combining LPT and MULTIFIT , 1988, Discret. Appl. Math..

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