A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective

Computers and Operations Research

Volumn 38, Issue 5, 2011, Pages 854-867

  Zhang, Rui ^a   Wu, Cheng ^b  

^a NANCHANG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Blocks; Network flows; Shop scheduling; Simulated annealing; Weighted tardiness

Indexed keywords

BLOCK PROPERTIES; BLOCKS; COMPUTATIONAL RESULTS; DUE DATES; HIGH-QUALITY SOLUTIONS; JOB SHOP SCHEDULING PROBLEMS; MAKESPAN MINIMIZATION; MANUFACTURING SYSTEM; MATHEMATICAL PROGRAMMING MODELS; NEIGHBORHOOD STRUCTURE; NETWORK FLOWS; OBJECTIVE FUNCTIONS; SEARCHING CAPABILITY; SERVICE REPUTATION; SHOP SCHEDULING; SIMULATED ANNEALING ALGORITHMS; TOTAL-WEIGHTED TARDINESS; WEIGHTED TARDINESS;

ANNEALING; MACHINE SHOPS; MATHEMATICAL PROGRAMMING; SCHEDULING ALGORITHMS;

SIMULATED ANNEALING;

EID: 78149284909     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.09.014     Document Type: Article

References (47)

1. J.K. Lenstra, A.H.G.R. Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
2. J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for job shop scheduling Management Science 34 3 1988 391 401
3. M. Kolonko Some new results on simulated annealing applied to the job shop scheduling problem European Journal of Operational Research 113 1 1999 123 136
4. S.G. Ponnambalam, N. Jawahar, and P. Aravindan A simulated annealing algorithm for job shop scheduling Production Planning & Control 10 8 1999 767 777
5. T.-Y. Wang, and K.-B. Wu A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems International Journal of Systems Science 31 4 2000 537 542
6. R. Cheng, and M. Gen A tutorial survey of job-shop scheduling problems using genetic algorithmspart I: representation Computers & Industrial Engineering 34 4 1996 983 997
7. R. Cheng, and M. Gen A tutorial survey of job-shop scheduling problems using genetic algorithmspart II: hybrid genetic search strategies Computers & Industrial Engineering 36 2 1999 343 364
8. I. Essafi, Y. Mati, and S. Dauzre-Prs A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem Computers & Operations Research 35 8 2008 2599 2616
9. H. Zhou, W. Cheung, and L.C. Leung Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm European Journal of Operational Research 194 3 2009 637 649
10. E. Nowicki, and C. Smutnicki An advanced tabu search algorithm for the job shop problem Journal of Scheduling 8 2 2005 145 159
11. Grabowski J, Wodecki M. A very fast tabu search algorithm for job shop problem. In: Metaheuristic optimization via memory and evolution: tabu search and scatter search. US: Springer; 2005. p. 11744.
12. V. Amaral Armentano, and C. Rigo Scrich Tabu search for minimizing total tardiness in a job shop International Journal of Production Economics 63 2 2000 131 140
13. C. Rigo Scrich, V. Amaral Armentano, and M. Laguna Tardiness minimization in a flexible job shop: a tabu search approach Journal of Intelligent Manufacturing 15 1 2004 103 115
14. D.Y. Sha, and C.-Y. Hsu A hybrid particle swarm optimization for job shop scheduling problem Computers & Industrial Engineering 51 4 2006 791 808
15. Z. Lian, B. Jiao, and X. Gu A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan Applied Mathematics and Computation 183 2 2006 1008 1017
16. W. Xia, and Z. Wu A hybrid particle swarm optimization approach for the job-shop scheduling problem The International Journal of Advanced Manufacturing Technology 29 34 2006 360 366
17. M.L. Pinedo Scheduling: theory, algorithms and systems 3rd ed. 2008 Springer New York
18. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimisation and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
19. M. Singer, and M. Pinedo A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops IIE Transactions 30 2 1998 109 118
20. A.P. Vepsalainen, and T.E. Morton Priority rules for job shops with weighted tardy costs Management Science 33 8 1987 1035 1047
21. E. Kutanoglu, and I. Sabuncuoglu An analysis of heuristics in a dynamic job shop with weighted tardiness objectives International Journal of Production Research 37 1 1999 165 187
22. M. Pinedo, and M. Singer A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop Naval Research Logistics 46 1 1999 1 17
23. S.J. Mason, J.W. Fowler, and W.M. Carlyle A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops Journal of Scheduling 5 3 2002 247 262
24. L. Mnch, and R. Drießel A distributed shifting bottleneck heuristic for complex job shops Computers & Industrial Engineering 49 3 2005 363 380
25. S. Kreipl A large step random walk for minimizing total weighted tardiness in a job shop Journal of Scheduling 3 3 2000 125 138
26. D.C. Mattfeld, and C. Bierwirth An efficient genetic algorithm for job shop scheduling with tardiness objectives European Journal of Operational Research 155 3 2004 616 630
27. M. Singer Decomposition methods for large job shops Computers & Operations Research 28 3 2001 193 207
28. M. Asano, and H. Ohta A heuristic for job shop scheduling to minimize total weighted tardiness Computers & Industrial Engineering 42 24 2002 137 147
29. K.M.J. Bontridder Minimizing total weighted tardiness in a generalized job shop Journal of Scheduling 8 6 2005 479 496
30. R. Tavakkoli-Moghaddam, M. Khalili, and B. Naderi A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness Soft Computing 13 10 2009 995 1006
31. R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra Job shop scheduling by local search INFORMS Journal on Computing 8 3 1996 302 317
32. J. Baewicz, W. Domschke, and E. Pesch The job shop scheduling problem: conventional and new solution techniques European Journal of Operational Research 93 1 1996 1 33
33. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra Job shop scheduling by simulated annealing Operations Research 40 1 1992 113 125
34. K. Krishna, K. Ganeshan, and D.J. Ram Distributed simulated annealing algorithms for job shop scheduling IEEE Transactions on Systems, Man and Cybernetics 25 7 1995 1102 1109
35. F. Glover Tabu searchpart I ORSA Journal on Computing 1 3 1989 190 206
36. F. Glover Tabu searchpart II ORSA Journal on Computing 2 1 1990 4 32
37. M. Dell'Amico, and M. Trubian Applying tabu search to the job-shop scheduling problem Annals of Operations Research 41 3 1993 231 252
38. J.W. Barnes, and J.B. Chambers Solving the job shop scheduling problem with tabu search IIE Transactions 27 2 1995 257 263
39. E. Nowicki, and C. Smutnicki A fast taboo search algorithm for the job shop problem Management Science 42 6 1996 797 813
40. S.D. Wu, E.S. Byeon, and R.H. Storer A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness Operations Research 47 1 1999 113 124
41. P. Brucker Scheduling algorithms 5th ed. 2007 Springer Berlin, Heidelberg
42. A. Sprecher, R. Kolisch, and A. Drexl Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem European Journal of Operational Research 80 1 1995 94 102
43. M.L. Pinedo Planning and scheduling in manufacturing and services 2nd ed. 2009 Springer New York
44. B. Giffler, and G.L. Thompson Algorithms for solving production scheduling problems Operations Research 8 4 1960 487 503
45. R. Zhang, and C. Wu A hybrid immune simulated annealing algorithm for the job shop scheduling problem Applied Soft Computing 10 1 2010 79 89
46. R. Zhang, and C. Wu A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem Engineering Optimization 42 7 2010 641 670
47. C. Rego, and R. Duarte A filter-and-fan approach to the job shop scheduling problem European Journal of Operational Research 194 3 2009 650 662