Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2866-2876

  Perez Gonzalez, Paz ^a   Framinan, Jose M ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Flowshop; Machine availability; Makespan; Scheduling

Indexed keywords

HEURISTIC METHODS; INDUSTRIAL RESEARCH; SCHEDULING;

AVAILABILITY CONSTRAINTS; CLASSICAL COUNTERPARTS; DIFFERENT STRUCTURES; FLOWSHOP; MACHINE AVAILABILITY; MAKESPAN; PERMUTATION FLOW SHOPS; PLANNING PERIODS; PROCESSING TIME;

AVAILABILITY;

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

References (39)

1. Aggoune R., and Portmann M.C. Flow shop scheduling problem with limited machine availability: a heuristic approach. International Journal of Production Economics 99 1-2 (2006) 4-15
2. Allaoui H., Artiba A., Elmaghraby S.E., and Riane F. Scheduling of a two-machine flowshop with availability constraints on the first machine. International Journal of Production Economics 99 1-2 (2006) 16-27
3. Ruiz R., Carlos Garcia-Diaz J.C., and Maroto C. Considering scheduling and preventive maintenance in the flowshop sequencing problem. Computers and Operations Research 34 11 (2007) 3314-3330
4. Framinan J.M., Gupta J.N.D., and Leisten R. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55 12 (2004) 1243-1255
5. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 3 (2005) 479-494
6. Keskinocak P., and Tayur S. Due date management policies. In: Simchi-Levi D., Wu D., and Shen M. (Eds). Handbook of quantitative supply chain analysis (2004), Kluwer Academic Publishers 485-547 [book chapter 12]
7. Wang X., and Cheng T.C.E. An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint. Computers and Operations Research 34 10 (2007) 2894-2901
8. Lee C.Y., Lei L., and Pinedo M. Current trends in deterministic scheduling. Annals of Operations Research 70 (1997) 1-41
9. Sanlaville E., and Schmidt G. Machine scheduling with availability constraints. Acta Informatica 35 9 (1998) 795-811
10. Turkcan A. Machine scheduling with availability constraints. Technical report, Industrial Engineering Department, Bilkent University, Ankara, Turkey, 1999. Retrieved May 14, 2008 〈http://www.ie.bilkent.edu.tr/∼ie672/docs/./present/turkcan.ps〉.
11. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 121 1 (2000) 1-15
12. Lee C.Y. Machine scheduling with availability constraints. In: Leung J.Y.T. (Ed). Handbook of scheduling. Algorithms, Models, and Performance Analysis (2004), Boca Raton, Chapman & Hall/CRC Press 22.1-22.13
13. Cheng T.C.E., and Liu Z. Approximability of two-machine no-wait flowshop scheduling with availability constraints. Operations Research Letters 31 4 (2003) 319-322
14. Cheng T.C.E., and Liu Z. 3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. Information Processing Letters 88 4 (2003) 161-165
15. Ng C.T., and Kovalyov M.Y. An FPTAS for scheduling a two-machine flowshop with a one unavailability interval. Naval Research Logistics 51 3 (2004) 307-315
16. Breit J. An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Information Processing Letters 90 6 (2004) 273-278
17. Breit J. A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. Computers and Operations Research 33 8 (2006) 2143-2153
18. Wang X., and Cheng T.C.E. Heuristics for two-machine flowshop scheduling with setup times and an availability constraint. Computers and Operations Research 34 1 (2007) 152-162
19. Aggoune R, Mahdi AH, Portmann MC. Genetic algorithms for the flow shop scheduling problem with availability constraints. In: IEEE international conference on systems, man, and cybernetics 2001, vol. 4, 2001. p. 2546-51.
20. Aggoune R. Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research 153 3 (2004) 534-543
21. Lee C.Y. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters 20 3 (1997) 129-139
22. Johnson S.M. Optimal two-stages and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-67
23. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 2 (1976) 117-129
24. Graham R., Lawer E., Lenstra J., and Rinnooy Kan A. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
25. Pinedo M. Scheduling: theory, algorithms, and systems. In: Prentice-Hall international series in industrial and system engineering. Englewood Cliffs, New Jersey, USA: Prentice-Hall; 1995.
26. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 1 (1990) 65-74
27. Armentano V.A., and Ronconi D.P. Tabu search for total tardiness minimization in flowshop scheduling problems. Computers and Operations Research 26 3 (1999) 219-235
28. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 2 (1993) 278-285
29. Framinan JM, Leisten R. Total tardiness minimisation in permutations flow shops: a simple approach based on a variable greedy algorithm. International Journal of Production Research 2008;46(22):6479-98.
30. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91 1 (1996) 160-175
31. Watson J.P., Barbulescu L., Darrell Whitley L., and Howe A.E. Constrasting structured and random permutation flowshop scheduling problems: search-space topology and algorithm performance. Informs Journal on Computing 14 2 (2002) 98-122
32. Exploiting problem structure in scheduling. Colorado State University, USA, 2003. Retrieved May 14, 2008 〈http://www.cs.colostate.edu/sched〉.
33. Rajendran C., and Ziegler H. A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs. European Journal of Operational Research 131 3 (2001) 622-634
34. Celia A.G., Gupta N.D., and Potts C.N. Two-machine no-wait flow shop scheduling with missing operations. Mathematics of Operations Research 24 4 (1999) 911
35. Hefetz N., and Adiri I. A note on the influence of missing operations on scheduling problems. Naval Research Logistics 29 3 (1982) 535-539
36. Montgomery D.C. Design and analysis of experiments. 6th ed. (2005), Wiley, New York, USA
37. Framinan J.M., Leisten R., and Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 41 1 (2003) 121-148
38. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 117 3 (2007) 2033-2049
39. Kalczynski P.J., and Kamburowski J. An improved NEH heuristic to minimize makespan in permutation flow shops. Computers and Operations Research 35 9 (2008) 3001-3008