Computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

European Journal of Operational Research

Volumn 130, Issue 3, 2001, Pages 559-575

  Cheng, Jinliang ^a   Steiner, George ^a   Stephenson, Paul ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; FUZZY SETS; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING; STATISTICAL METHODS;

PERMUTATION FLOW SHOP SCHEDULING;

PRODUCTION CONTROL;

EID: 0034831802     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00415-4     Document Type: Article

References (23)

1. J. Achugbue, F. Chin, Complexity and solutions of some three-stage flow shop scheduling problems, Mathematics of Operations Research 7 (1982) 532-544.
2. J. Carlier, I. Rebai, Two branch and bound algorithms for the permutation flow shop problem, European Journal of Operational Research 90 (1996) 238-251.
3. J. Cheng, H. Kise, H. Matsumoto, A branch-and-bound algorithm with fuzzy inference for a permutation flow shop scheduling problem, European Journal of Operational Research 96 (1997) 578-590.
4. J. Cheng, G. Steiner, P. Stephenson, A fast algorithm to minimize makespan for the two-machine flow-shop problem with release times, Working Paper No. 438, Faculty of Business, McMaster University, Hamilton, Ont., 1999.
5. J. Cheng, G. Steiner, P. Stephenson, A fast algorithm to minimize maximum lateness for the two-machine flow-shop problem with release times, Working Paper No. 439, Faculty of Business, McMaster University, Hamilton, Ont., 1999.
6. Y. Cho, S. Sahni, Preemptive scheduling of independent jobs with release and due date times on open flow and job shops, Operations Research 29 (1981) 511-522.
7. R.W. Conway, W.D. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967.
8. M.R. Garey, D.S. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1 (1976) 117-129.
9. J. Grabowski, On two-machine scheduling with release and due dates to minimize maximum lateness, Journal of the Operational Research Society of India 17 (1980) 133-154.
10. J. Grabowski, E. Skubalska, C. Smutnicki, On flow shop scheduling with release and due dates to minimize maximum lateness, Journal of the Operational Research Society 34 (1983) 615-620.
11. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: A survey, Annals of Discrete Mathematics 5 (1979) 287-326.
12. A.M.A. Hariri, C.N. Potts, An algorithm for single machine sequencing with release dates to minimize total weighted completion time, Discrete Applied Mathematics 5 (1983) 99-109.
13. W.A. Horn, Some simple scheduling algorithms, Naval Research Logistics Quarterly 21 (1974) 177-185.
14. S.M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1 (1954) 61-68.
15. C. Koulamas, On the complexity of two-machine flowshop problems with due date related objectives, European Journal of Operational Research 106 (1998) 95-100.
16. B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flowshop problem, Operations Research 26 (1978) 53-67.
17. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Bruker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343-362.
18. M. Nawaz, E. Enscore Jr., I. Ham, A heuristic algorithm for the m-machine n-job flow-shop sequencing problem, OMEGA, The International Journal of Management Science 11 (1983) 91-95.
19. E. Novicki, C. Smutnicki, On lower bounds on the minimum maximum lateness on one machine subject to release dates, OPSEARCH 24 (1987) 106-110.
20. C.N. Potts, An adaptive branching rule for the permutation flow-shop problem, European Journal of Operational Research 5 (1980) 19-25.
21. R. Tadei, J.N.D. Gupta, F. Della Croce, M. Cortesi, Minimising makespan in the two-machine flow-shop with release times, Journal of the Operational Research Society 49 (1998) 77-85.
22. E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research 47 (1990) 65-74.
23. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64 (1993) 278-285.