Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times

Computers and Industrial Engineering

Volumn 61, Issue 2, 2011, Pages 336-345

  Driessel, Rene ^a   Mönch, Lars ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Parallel machines; Scheduling; Semiconductor manufacturing; Total weighted tardiness; Variable neighborhood search

Indexed keywords

AUTOMATED TRANSPORT; COMPLEX JOB SHOP; COMPUTATIONAL EXPERIMENT; DECOMPOSITION APPROACH; DISPATCHING RULES; IDENTICAL PARALLEL MACHINES; INITIAL SOLUTION; JOB SHOP; ON-TIME DELIVERY PERFORMANCE; PARALLEL MACHINE; PERFORMANCE MEASURE; PRECEDENCE CONSTRAINTS; SCHEDULING JOBS; SCHEDULING PROBLEM; SEMICONDUCTOR MANUFACTURING; SEQUENCE-DEPENDENT SETUP TIME; SOLUTION PROCEDURE; SOLUTION QUALITY; SUB-PROBLEMS; TARDINESS COST; TEST INSTANCES; TOTAL-WEIGHTED TARDINESS; VARIABLE NEIGHBORHOOD SEARCH;

BUSINESS MACHINES; MANUFACTURE; SCALES (WEIGHING INSTRUMENTS); SEMICONDUCTOR DEVICE MANUFACTURE;

SCHEDULING;

EID: 79958031546     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.07.001     Document Type: Conference Paper

References (43)

1. J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for job shop scheduling Management Science 34 1988 391 401
2. I. Aho, and E. Mäkinen On a parallel machine scheduling problem with precedence constraints Journal of Scheduling 9 2006 493 495
3. A. Allahverdi, C.T. Ng, T.C.E. Cheng, and M.Y. Kovalyov A survey of scheduling problems with setup times or costs European Journal of Operational Research 187 2008 985 1032 (Pubitemid 350236619)
4. Almeder, C., & Mönch, L. (2009). Variable neighborhood search for parallel batch machine scheduling. In Proceedings of the 8th metaheuristic international conference (MIC 2009).
5. D. Anghinolfi, and M. Paolucci Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach Computers & Operations Research 34 2007 3471 3490 (Pubitemid 46517867)
6. D. Anghinolfi, and M. Paolucci A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem International Journal of Operations Research 5 1 2008 1 17
7. D. Anghinolfi, and M. Paolucci A new discrete particle swarm optimization approach for the total weighted tardiness scheduling problem European Journal of Operational Research 193 1 2009 73 85
8. G.K. Angrawal, and S.S. Heragu A survey on automated material handling systems in 300-mm semiconductor fabs IEEE Transactions on Semiconductor Manufacturing 19 1 2006 112 119
9. H. Balasubramanian, L. Mönch, J.W. Fowler, and M. Pfund Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness International Journal of Production Research 42 8 2004 1621 1638
10. Bierwirth, C., Mattfeld, D., & Kopfer, H. (1996). On permutation representations for scheduling problems. In Proceedings parallel problem solving from nature (Vol. IV, pp. 310-318). (Pubitemid 126128319)
11. P. Brucker, and S. Knust Complex scheduling 2006 Berlin Springer
12. den Besten, M. L., & Stützle, T. (2001). Neighborhoods revisited: Investigation into the effectiveness of variable neighborhood descent for scheduling. In Proceedings of the 4th Metaheuristic International Conference (MIC 2001) (pp. 545-549).
13. M.M. Dessouky Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness Computers and Industrial Engineering 34 4 1998 793 806
14. Driessel, R., & Mönch, L. (2008). An integrated scheduling and automated material handling approach for complex manufacturing systems. In Proceedings of the 2008 IEEE international conference on industrial engineering and engineering management (IEEM 2008) (pp. 826-830).
15. Driessel, R., & Mönch, L. (2009). Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search in Table. In Proceedings 39th computer and industrial engineering conference (CIE 39) (pp. 317-322).
16. A. Gharbi, and M. Haouari Minimizing makespan on parallel machines subject to release dates and delivery times Journal of Scheduling 5 2002 329 355
17. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
18. S.R. Gupta, and J.S. Smith Algorithms for single machine total tardiness scheduling with sequence dependent setups European Journal of Operational Research 175 2006 722 739 (Pubitemid 44345073)
19. P. Hansen, and N. Mladenovic Variable neighborhood search: Principles and applications European Journal of Operational Research 130 2001 449 467 (Pubitemid 32875304)
20. J. Hermann, J.-M. Proth, and N. Sauer Heuristics for unrelated machine scheduling with precedence constraints European Journal of Operational Research 102 1997 528 537 (Pubitemid 127397089)
21. X. Hu, J.-S. Bao, and Y. Jin Minimizing make span on parallel machines with precedence constraints and machine eligibility restrictions International Journal of Production Research 48 6 2010 1639 1651
22. J. Hurink, and S. Knust List scheduling in a parallel machine environment with precedence constraints and setup times Operations Research Letters 29 2001 231 239 (Pubitemid 34065064)
23. Kim, S.-I., Choi, H.-S., & Lee, D.-H. (2006). Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times. In Proceedings ICCSA 2006, LNCS 3982 (pp. 728-737). (Pubitemid 44045249)
24. Klemmt, A., Weigert, G., Almeder, C., & Mönch, L. (2009). A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems. In Proceedings of the modeling and analysis of semiconductor manufacturing conference (MASM) 2009 (pp. 1686-1694).
25. E.L. Lawler A pseudopolynomial time algorithm for sequencing jobs to minimize total weighted tardiness Annals of Discrete Mathematics 1 1977 331 342
26. Y.H. Lee, and M. Pinedo Scheduling jobs on parallel machines with sequence-dependent setup times European Journal of Operational Research 100 1997 464 474 (Pubitemid 127392370)
27. C.-J. Liao, and C.-C. Cheng A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date Computers & Industrial Engineering 52 2007 404 413 (Pubitemid 46719704)
28. C.-J. Liao, and H.-C. Juan An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups Computers & Operations Research 2007 1899 1909 (Pubitemid 44879763)
29. S.-W. Lin, and K.-C. Ying Solving single machine total weighted tardiness problems with sequence dependent setup times by meta-heuristics International Journal of Advanced Manufacturing Technology 34 2007 1183 1190 (Pubitemid 47561826)
30. X. Lou, C. Chu, and C. Wang Some dominance properties for single-machine tardiness problems with sequence-dependent setup International Journal of Production Research 44 17 2006 3367 3378 (Pubitemid 43898307)
31. N. Mladenovic, and P. Hansen Variable neighborhood search Computers & Operations Research 24 1997 1097 1100
32. L. Mönch, and R. Driessel A distributed shifting bottleneck heuristic for complex job shops Computers & Industrial Engineering 49 2005 673 680
33. L. Mönch, R. Schabacker, D. Pabst, and J.W. Fowler Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops European Journal of Operational Research 177 3 2007 2100 2118 (Pubitemid 44709466)
34. Mönch, L., Fowler, J.W., Mason, S.J., Dauzere-Peres, S., & Rose, O. (2009). Scheduling semiconductor manufacturing operations: Problems, solution techniques, and future challenges. In Proceedings 4th multidisciplinary international scheduling conference (MISTA) (pp. 192-201).
35. I.M. Ovacik, and R. Uzsoy Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times International Journal of Production Research 33 1995 3173 3292
36. I.M. Ovacik, and R. Uzsoy Decomposition methods for complex factory scheduling problems 1997 Kluwer Academic Publishers Massachusetts
37. Y. Park, S. Kim, and Y.-H. Lee Scheduling jobs on parallel machines applying neural networks and heuristic rules Computers & Industrial Engineering 38 2000 189 202
38. M. Pfund, J.W. Fowler, A. Gadkari, and Y. Chen Scheduling jobs on parallel machines with setup times and ready times Computers & Industrial Engineering 54 2008 764 782 (Pubitemid 351458378)
39. M.L. Rocha, M.G. Ravetti, G.R. Mateus, and P.M. Pardalos Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search IMA Journal of Management Mathematics 18 2007 101 115 (Pubitemid 46552838)
40. Sevkli, M., & Aydin, M.E. (2006). A variable neighbourhood search algorithm for job shop scheduling problems. In Proceedings EvoCOP 2006, LNCS 3906 (pp. 261-271). (Pubitemid 44019290)
41. R. Uzsoy, C.Y. Lee, and L.A. Martin-Vega A review of production planning and scheduling models in the semiconductor industry, part II: Shop floor control IIE Transactions 26 1994 44 55
42. A. Vepsalainen, and T.E. Morton Priority rules and lead time estimates for job shop scheduling with weighted tardiness costs Management Science 33 1987 1036 1047
43. X. Wang, and L. Tang A population-based variable neighborhood search for the single machine total weighted tardiness problem Computers & Operations Research 36 6 2009 2105 2110