A hybrid approach to large-scale job shop scheduling

Applied Intelligence

Volumn 32, Issue 1, 2010, Pages 47-59

  Zhang, Rui ^a   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Bottleneck; Decomposition; Genetic algorithm; Job Shop; Simulated annealing

Indexed keywords

BOTTLENECK; CHARACTERISTIC VALUE; COMPUTATIONAL RESULTS; FUZZY INFERENCE SYSTEMS; HYBRID APPROACH; HYBRID OPTIMIZATION ALGORITHM; IMMUNE MECHANISM; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; OPTIMIZATION EFFICIENCY; SCHEDULING PROBLEM; TOTAL-WEIGHTED TARDINESS;

ANNEALING; COMPUTATIONAL EFFICIENCY; FUZZY INFERENCE; GENETIC ALGORITHMS; SCALES (WEIGHING INSTRUMENTS);

SIMULATED ANNEALING;

EID: 75849162596     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-008-0134-y     Document Type: Article

References (28)

1. J Adams E Balas D Zawack 1988 The shifting bottleneck procedure for job shop scheduling Manage Sci 34 3 391 401 0637.90051 10.1287/mnsc.34.3.391 938771
2. MH Bassett JF Pekny GV Reklaitis 1996 Decomposition techniques for the solution of large-scale scheduling problems AIChE J 42 12 3373 3387 10.1002/aic.690421209
3. Braune R, Wagner S, Affenzeller M (2007) Optimization methods for large-scale production scheduling problems. Lecture notes in computer science, vol 4739. Springer, Berlin, pp 812-819
4. ES Byeon SD Wu RH Storer 1998 Decomposition heuristics for robust job-shop scheduling IEEE Trans Robot Autom 14 2 303 313 10.1109/70.681248
5. R Cheng M Gen 1996 A tutorial survey of job-shop scheduling problems using genetic algorithms-Part I: representation Comput Ind Eng 34 4 983 997 10.1016/0360-8352(96)00047-2 (Pubitemid 126375908)
6. R Cheng M Gen 1999 A tutorial survey of job-shop scheduling problems using genetic algorithms-Part II: hybrid genetic search strategies Comput Ind Eng 36 2 343 364 10.1016/S0360-8352(99)00136-9
7. FD Croce R Tadei G Volta 1995 A genetic algorithm for the job-shop problem Comput Oper Res 22 1 15 24 0816.90081 10.1016/0305-0548(93)E0015-L
8. M Dell'Amico M Trubian 1993 Applying tabu search to the job-shop scheduling problem Ann Oper Res 41 3 231 252 0771.90056 10.1007/BF02023076
9. I Essafi Y Mati S Dauzère-Pérès 2008 A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem Comput Oper Res 35 8 2599 2616 1177.90155
10. AS Jain S Meeran 1999 Deterministic job-shop scheduling: Past, present and future Eur J Oper Res 113 2 390 434 0938.90028 10.1016/S0377-2217(98)00113-1
11. Jang JSR, Sun CT, Mizutani E (1997) Neuro-fuzzy and soft computing. Prentice-Hall, Englewood Cliffs
12. L Jiao L Wang 2000 A novel genetic algorithm based on immunity IEEE Tran Syst Man Cybern Part A 30 5 552 561 10.1109/3468.867862 (Pubitemid 30938449)
13. M Kolonko 1999 Some new results on simulated annealing applied to the job shop scheduling problem Eur J Oper Res 113 1 123 136 0933.90029 10.1016/S0377-2217(97)00420-7
14. PJM Laarhoven EHL Aarts JK Lenstra 1992 Job shop scheduling by simulated annealing Oper Res 40 1 113 125 0751.90039 10.1287/opre.40.1.113 1152731
15. JK Lenstra AHGR Kan P Brucker 1977 Complexity of machine scheduling problems Ann Discrete Math 7 343 362 10.1016/S0167-5060(08)70743-X
16. M Liu JH Hao C Wu 2008 A prediction based iterative decomposition algorithm for scheduling large-scale job shops Math Comput Model 47 3-4 411 421 1170.90396 10.1016/j.mcm.2007.03.032 2378845
17. PB Luh L Gou Y Zhang T Nagahora M Tsuji K Yoneda T Hasegawa Y Kyoya T Kano 1998 Job shop scheduling with group-dependent setups, finite buffers and long time horizon Ann Oper Res 76 233 259 0896.90138 10.1023/A:1018948621875 (Pubitemid 128405205)
18. L Mönch R Schabacker D Pabst JW Fowler 2007 Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops Eur J Oper Res 177 3 2100 2118 1109.90044 10.1016/j.ejor.2005. 12.020 (Pubitemid 44709466)
19. E Nowicki C Smutnicki 1996 A fast taboo search algorithm for the job shop problem Manage Sci 42 6 797 813 0880.90079 10.1287/mnsc.42.6.797 (Pubitemid 126577322)
20. SS Panwalkar W Iskander 1977 A survey of scheduling rules Oper Res 25 1 45 61 0369.90054 10.1287/opre.25.1.45 443969
21. MW Park YD Kim 1998 A systematic procedure for setting parameters in simulated annealing algorithms Comput Oper Res 25 3 207 217 0904.90142 10.1016/S0305-0548(97)00054-3
22. M Singer 2001 Decomposition methods for large job shops Comput Oper Res 28 3 193 207 0964.90020 10.1016/S0305-0548(99)00098-2 1798541
23. D Sun R Batta 1996 Scheduling larger job shops: a decomposition approach Int J Prod Res 34 7 2019 2033 0928.90036 10.1080/00207549608905010
24. L Tang PB Luh J Liu L Fang 2002 Steel-making process scheduling using Lagrangian relaxation Int J Prod Res 40 1 55 70 1175.90150 10.1080/ 00207540110073000 (Pubitemid 34593845)
25. AP Vepsalainen TE Morton 1987 Priority rules for job shops with weighted tardy costs Manage Sci 33 8 95 103 10.1287/mnsc.33.8.1035
26. SD Wu ES Byeon RH Storer 1999 A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness Oper Res 47 1 113 124 0979.90030 10.1287/opre.47.1.113 1689986
27. CY Zhang PG Li YQ Rao ZL Guan 2008 A very fast TS/SA algorithm for the job shop scheduling problem Comput Oper Res 35 1 282 294 1149.90345 10.1016/j.cor.2006.02.024 2312271 (Pubitemid 46899361)
28. Zhou H, Cheung W, Leung LC (2008) Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur J Oper Res. doi: 10.1016/j.ejor.2007.10.063