Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research

Volumn 33, Issue 6, 2006, Pages 1540-1556

  Fondrevelle, Julien ^a   Oulamara, Ammar ^a   Portmann, Marie Claude ^a  

^a INRIA   (France)

Author keywords

Branch and bound; Complexity; Heuristics; Minimal and maximal time lags; Permutation flowshop

Indexed keywords

BENCHMARKING; CONSTRAINT THEORY; HEURISTIC METHODS; JOB ANALYSIS; PROBLEM SOLVING;

BRANCH AND BOUND; COMPLEXITY; HEURISTICS; MINIMAL AND MAXIMAL TIME LAGS; PERMUTATION FLOWSHOP;

SCHEDULING;

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

References (18)

1. A. Hodson, A.P. Muhlemann, and D.H.R. Price A microcomputer based solution to a practical scheduling problem Journal of the Operational Research Society 36 10 1985 903 914
2. C. Chu, and J-M. Proth Single machine scheduling with chain structured precedence constraints and separation time windows IEEE Transactions on Robotics and Automation 12 6 1996 835 843
3. Deppner F. Ordonnancement d'atelier avec contraintes temporelles entre opérations. PhD thesis, Institut National Polytechnique de Lorraine, France; 2004 (in French).
4. P. Brucker, S. Knust, T.C.E. Cheng, and N.V. Shakhlevich Complexity results for flow-shop and open-shop scheduling problems with transportation delays Annals of Operations Research 129 2004 81 106
5. M. Dell'Amico Shop problems with two machines and time lags Operations Research 44 5 1996 777 787
6. Yu W, The two-machine flow shop problem with delays and the one-machine total tardiness problem. PhD thesis, Technische Universiteit Eindhoven, The Netherlands; 1996.
7. W. Yu, H. Hoogeveen, and J.K. Lenstra Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard Journal of Scheduling 7 2004 333 348
8. D.L. Yang, and M.S. Chern A two-machine flowshop sequencing problem with limited waiting time constraints Computers and Industrial Engineering 28 1 1995 63 70
9. S.M. Johnson Optimal two and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1 1954 61 68
10. L.G. Mitten Sequencing n jobs on two machines with arbitrary time lags Management Science 5 1959 293 298
11. A.H.G. Rinnooy Kan Machine scheduling problems classification, complexity and computations 1976 Nijhoff The Hague
12. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys Sequencing and scheduling algorithms and complexity S.C. Graves P.H. Zipkin A.H.G. Rinnooy Kan Handbooks in operations research and management science, vol. 4 1993 Amsterdam North-Holland 7 10
13. P.C. Gilmore, and R.E. Gomory Sequencing a one state variable machine a solvable case of the traveling salesman problem Operations Research 12 5 1964 655 679
14. G. Finke, M-L. Espinouse, and H. Jiang General flowshop models job dependent capacities, job overlapping and deterioration International Transactions in Operational Research 9 2002 399 414
15. M.R. Garey, and D.S. Johnson Computers and Intractability A guide to the theory of NP-completeness 1979 W.H.Freeman New York
16. E.J. Ignall, and L.E. Schrage Application of the branch and bound technique to some flow-shop scheduling problems Operations Research 13 1965 400 412
17. M. Nawaz, E.E. Enscore Jr, and I. Ham A heuristic algorithm for the m -machine, n -job flow shop sequencing problem Omega 11 1983 91 95
18. H.G. Campbell, R.A. Dudek, and M.L. Smith A heuristic algorithm for the n job, m machine sequencing problem Management Science 16 10 1970 630 637