Parallel machine scheduling with precedence constraints and setup times

Computers and Operations Research

Volumn 37, Issue 12, 2010, Pages 2141-2151

  Gacias, Bernat ^a,b   Artigues, Christian ^a,b   Lopez, Pierre ^a,b  

^a LAAS CNRS   (France)

^b INSA   (France)

Author keywords

Branch and bound; Dominance conditions; Limited discrepancy search; Local search; Parallel machine scheduling; Precedence constraints; Setup times

Indexed keywords

BRANCH AND BOUNDS; LOCAL SEARCH; PARALLEL MACHINE SCHEDULING; PRECEDENCE CONSTRAINTS; SET-UP TIME;

MACHINERY;

SCHEDULING ALGORITHMS;

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

References (32)

1. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 1979 287 326
2. T. Cheng, and C. Sin A state-of-the-art review of parallel-machine scheduling research European Journal of Operational Research 47 1990 271 292
3. Z.-L. Chen, and W.B. Powell Solving parallel machine scheduling problems by column generation INFORMS Journal on Computing 11 1 1999 78 94
4. W.L. Pearn, S.H. Chung, and C.M. Lai Scheduling integrated circuit assembly operations on die bonder IEEE Transactions on Electronics Packaging Manufacturing 30 2 2007
5. Salem A, Anagnostopoulos GC, Rabadi G. A branch-and-bound algorithm for parallel machine scheduling problems. In: Society for computer simulation international (SCS). Portofino, Italy; 2000.
6. E. Nron, F. Tercinet, and F. Sourd Search tree based approaches for parallel machine scheduling Computers and Operations Research 35 4 2008 1127 1137 (Pubitemid 47404763)
7. I.D. Baev, W.M. Meleis, and A. Eichenberger An experimental study of algorithms for weighted completion time scheduling Algorithmica 22 2002 34 51
8. van den Akker M, Hoogeven J, Kempen J. Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines and/or generalized precedence constraints. Technical Report, Utrech university; 2005.
9. J.M.J. Schutten, and R.A.M. Leussink Parallel machine scheduling with release dates, due dates and family setup times International Journal of Production Economics 4647 1 1996 119 126
10. 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 11 1995 3173 3192
11. R. Uzsoy, and J.D. Velasquez Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times Computers and Operations Research 35 2008 2018 2033
12. R. Nessah, Ch. Chu, and F. Yalaoui An exact method for Pm sds, r i ∑ C i problem Computers and Operations Research 34 2005 2840 2848
13. J.M.J. Schutten List scheduling revisited Operations Research Letters 18 1994 167 170
14. 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
15. Milano M, Roli A. On the relation between complete and incomplete search: an informal discussion. In: Proceedings of CP-AI-OR'02. Le Croisic, France; 2002.
16. Neumann K, Schwindt C, Zimmermann J. Project scheduling with time windows and scarce resources. Springer-Verlag, Berlin, Heidelberg; 2003.
17. 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
18. C. Artigues, P. Lopez, and P.-D. Ayache Schedule generation schemes and priority rules for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis Annals of Operations Research 138 1 2005 21 52
19. Lopez P, Esquirol P. Consistency enforcing in scheduling: a general formulation based on energetic reasoning. In: Proceedings of fifth international workshop on project management and scheduling (PMS'96). Poznan, Poland; 1996.
20. E.L. Demeulemeester, and W.S. Herroelen New benchmark results for the resource-constrained project scheduling problem Management Science 43 11 1997 1485 1492
21. Harvey WD, Ginsberg ML. Limited discrepancy search. In: Proceedings of 14th IJCAI, 1995.
22. Korf R. Improved limited discrepancy search. In: Proceedings of 13th AAAI, 1996.
23. Walsh T. Depth-bounded discrepancy search. APES Group, Department of Computer Science; 1997.
24. Beck JC, Perron L. Discrepancy-bounded depth first search. In: Second international workshop on integration of AI and OR technologies for combinatorial optimization problems (CP-AI-OR'00). Paderborn, Germany; 2000.
25. Karoui W, Huguet M-J, Lopez P, Naanaa W. YIELDS: a yet improved limited discrepancy search for CSPs. In: Proceedings of fourth international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR'07). Brussels, Belgium; 2007.
26. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and practice of constraint programming-CP 98, 1998.
27. A. Ben Hmida, M.J. Huguet, P. Lopez, and M. Haouari Climbing depth-bounded discrepancy search for solving hybrid flow shop scheduling problems European Journal of Industrial Engineering 1 2 2007 223 243
28. P. Hansen, and N. Mladenovic Variable neighborhood search: principles and applications European Journal of Operational Research 130 2001 449 467 (Pubitemid 32875304)
29. Laborie P, Godard D. Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Baptiste P, Kendall G, Munier-Kordon A, Sourd F, editors. Proceedings of the third multidisciplinary international conference on scheduling: theory and applications (MISTA'07). Paris, France; 2007. p. 276284.
30. Laborie P. Ibm ilog cp optimizer for detailed scheduling illustrated on three problems. In: van Hoeve WJ, Hooker JN, editors. Proceedings of the sixth international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR'09). Lecture notes in computer science, vol. 5547. Pittsburgh, USA; 2009. p. 14862.
31. E. Demeulemeester, M. Vanhoucke, and W. Herroelen Rangen: a random network generator for activity-on-the-node networks Journal of Scheduling 6 2003 17 38
32. F. Sourd Earliness-tardiness scheduling with setup considerations Computers and Operations Research 32 7 2005 1849 1865