Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1250-1264

  Rocha, Pedro Leite ^a   Ravetti, Martín Gómez ^a   Mateus, Geraldo Robson ^a   Pardalos, Panos M ^b  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b University of Florida   (United States)

Author keywords

Branch and bound; GRASP; Machine dependent setups; Parallel machines; Scheduling; Sequence dependent setups

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

BRANCH-AND-BOUND; COMPUTATIONAL EXPERIMENTS; GRASP; MACHINE DEPENDENT SETUPS; METAHEURISTICS; PARALLEL MACHINES; SEQUENCE-DEPENDENT SETUPS;

SCHEDULING ALGORITHMS;

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

References (30)

1. Kim S.C., and Bobrowski P.M. Impact of sequence-dependent setup time on job shop scheduling performance. International Journal of Production Research 32 7 (1994) 1503-1520
2. Błażewicz J., Ecker K.H., Pesch E., Schmidt G., and Weglarz J. Scheduling computer and manufacturing processes (1996), Springer, Berlin
3. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman & Co, New York, NY, USA
4. Luh P.B., Gou L., Zhang Y., Nagahora T., Tsuji M., Yoneda K., Hasegawa T., Kyoya Y., and Kano T. Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annals of Operations Research 76 (1998) 233-259
5. Liu C.-Y., and Liao D.-Y. Scheduling flexible flowshops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 16 4 (2000) 408-419
6. Acero R, Delgado JT. Aplicación de una heurística de búsqueda tabú en un problema de programación de tareas en línea flexible de manufactura. available on-line at 〈http://hdl.handle.net/1992/570〉, 2000.
7. Meyr H. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research 120 2 (2000) 311-326
8. Meyr H. Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operations Research 139 2 (2002) 277-292
9. Hans-Joachim G., and John U. Methods for solving pratical problems of job-shop scheduling modelled in CLPFD. Conference on practical application of constraint technology (April 1996) 73-92
10. Koulamas C., and Kyparisis G.J. Makespan minimization on uniform parallel machines with release times. European Journal of Operational Research 157 1 (2004) 262-266
11. M. Pinedo, Scheduling-theory, algorithms and systems. Prentice-Hall international series in industrial and systems engineering, NJ, USA; 1995.
12. Lee C.-Y., and Pinedo M. Optimization and heuristics of scheduling. In: Pardalos P.M., and Resende M.G.C. (Eds). Handbook of applied optimization (2002), Oxford University Press, New York, NY, USA
13. Brucker P. Scheduling algorithms (2004), Springer, Berlin
14. Roundy R, Cakanyldirim M, Chen D, Freimer M, Jackson PL, Melkonian V. Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms. Technical Report 1233, School of Operations Research and Industrial Engineering, Cornell University, February; 1999.
15. Rabadi G., Mollaghasemi M., and Anagnostopoulos G.C. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. Computers & Operations Research 31 10 (2004) 1727-1751
16. Feo T., and Resende M. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 2 (1995) 109-133
17. Feo T., Venkatraman K., and Bard J. A GRASP for a difficult single machine scheduling problem. Computers & Operations Research 18 8 (1991) 635-643
18. Feo T., Sarathy K., and McGahan J. A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties. Computers & Operations Research 23 9 (1996) 881-895
19. Resende M.G.C., Binato S., Hery W.J., and Loewenstern D.M. A greedy randomized search procedure for job shop scheduling. In: Ribeiro C.C., and Hansen P. (Eds). Essays and surveys in metaheuristics (2002), Kluwer Academic, Dordrecht 59-80
20. Gómez Ravetti M, Rocha PL, Mateus GR. Programação de tarefas com máquinas paralelas não relacionadas, tempos de preparação de máquinas dependentes da seqüência, datas de entrega e restrições de elegibilidade. In: XXXVI SBPO-simpósio brasileiro de pesquisa operacional, São João Del Rei, MG, Brazil, 2004.
21. Manne A.S. On the jobshop scheduling problem. Operations Research 8 2 (1960) 219-223
22. Gómez Ravetti M, Mateus GR. Seqüenciamento de tarefas com máquinas paralelas permitindo atrasos e com tempos de preparação de máquinas dependentes da sequência. In: XXXV simpósio brasileiro de pesquisa operacional, Natal, Brazil; 2003.
23. Wagner H.W. An integer linear-programming model for machine scheduling. Naval Research Logistic Quarterly 6 2 (1959) 131-140
24. Rocha PL, Gómez Ravetti M, Mateus GR. The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with sequence-dependent setup times. In: Fourth EU/ME workshop on design and evaluation of advanced hybrid meta-heuristics, Nottingham, England; 2004. Available on-line at 〈http://webhost.ua.ac.be/eume/workshops/hybrid/A037Revised.pdf〉.
25. Laguna M., and Martí R. Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11 1 (1999) 44-52
26. Glover F. Tabu search and adaptive memory programming-advances. In: Barr R.S., Helgason R.V., and Kennington J.L. (Eds). Interfaces in computer science and operations research (1996), Kluwer Academic Publishers 1-75
27. Glover F., and Laguna M. Tabu search (1997), Kluwer, Boston, MA, USA
28. Pereira Lopes MJ, De Carvalho JMV. A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, European Journal of Operational Research, 2006, in press.
29. Ho J.C., and Chang Y.-L. Minimizing the number of tardy jobs for m parallel machines. European Journal of Operational Research 84 2 (1995) 343-355
30. Cormen T., Leiserson C., and Rivest R. Introduction to algorithms (1990), The MIT Press, Cambridge, MA, USA [Chapter 26], all-pairs shortest paths