An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion

References

• Campbell , H.G. , Dudek , R.A. and Smith , M.L. 1970 . A heuristic algorithm for the n-job tn-machine sequencing problem . Management Science , 16 : 630 – 637 .
   Web of Science ®Google Scholar
• Chen , B. , Glass , C.A. , Potts , C.N. and Strusevich , V.A. 1996 . A new heuristic for threemachine flow shop scheduling . Operations Research , 44 : 881 – 898 .
   Google Scholar
• Conway , R.W. , Maxwell , W.L. and Miller , L.W. 1967 . Theory of Scheduling , Reading MA : AddisonWesley .
   Google Scholar
• Dudek , R.A. , Panwalkar , S.S. and Smith , M.L. 1992 . The lessons of flowshop scheduling research . Operations Research , 40 : 7 – 13 .
   Web of Science ®Google Scholar
• Garey , M.R. , Johnson , D.S. and Sethi , R. 1976 . The complexity of flowshop and jobshop scheduling . Mathematics Operations Research , 1 : 117 – 129 .
   Google Scholar
• Johnson , S.M. 1954 . Optimal two-and three-stage production schedules with setup times included . Naval Research Logistic Quarterly , 1 : 61 – 68 .
   Google Scholar
• Lageweg , B.J. , Lenstra , J.K. and Rinnooy Kan , A.H.G. 1978 . A general bounding scheme for the permutation flow-shop problem . Operations Research , 26 : 53 – 67 .
   Web of Science ®Google Scholar
• Lawler , E.L. , Lenstra , J.K. , Rinnooy Kan , A.H.G. , Shmoys , D.B. , Graves , S.C. , Rinnooy Kan , A.H.G. and Zipkin , P.H. 1993 . “ Sequencing and Scheduling: Algorithms and Complexity, in: ” . In Handbooks in Operations Research and Management Science, Vol. 4: , 455 – 522 . North Holland, Amsterdam : Logistics of Production and Inventory .
   Google Scholar
• Lenstra , J.K. , Rinnooy Kan , A.H.G. and Brucker , P. 1977 . Complexity of machine scheduling problems . Annals Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Nawaz , M. , Enscore , E.E. Jr. and Ham , I. 1983 . A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem . OMEGA , 11 : 91 – 95 .
   Web of Science ®Google Scholar
• Potts , C.N. 1980 . An Adaptive branching rule for the permutation flow-shop problem . European Journal of Operational Research , 5 : 19 – 25 .
   Web of Science ®Google Scholar
• Rinnooy Kan , A.H.G. 1976 . An Adaptive branching rule for the permutation flow-shop problem , The Hague : Nijhoff .
   Google Scholar
• Röck , H. and Schmidt , G. 1983 . Machine aggregation heuristics in shop scheduling . Methods of Operations Research , 45 : 303 – 314 .
   Google Scholar
• Smutnicki , C. 1998 . Some results of the worst-case analysis for flow shop scheduling . European Journal of Operational Research , 109 : 66 – 87 .
   Web of Science ®Google Scholar
• Suliman , S.M.A. 2000 . A two-phase heuristic approach to the permutation flow-shop scheduling problem . International Journal of Production Economics , 64 : 143 – 152 .
   Web of Science ®Google Scholar
• Tang , H.C. 2001 . A new lower bonding rule for permutation flow shop scheduling . Journal of Information & Optimization Sciences , 22 : 249 – 257 .
   Google Scholar
• Tang , H.C. 2001 . A modification to the CGPS algorithm for three-machine flow shop scheduling . Journal of Information & Optimization Sciences , 22 : 321 – 331 .
   Google Scholar