14
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A worst-case analysis of the three-machine flow shop scheduling

Pages 229-240 | Received 01 Sep 2001, Published online: 18 Jun 2013

References

  • Chen , B. , Glass , C.A. , Potts , C.N. and Strusevich , V.A. 1996 . A new heuristic for three-machine flow shop scheduling . Operations Research , 44 : 891 – 898 .
  • Dudek , R.A. , Panwalkar , S.S. and Smith , M.L. 1992 . The lessons of flowshop scheduling research . Operations Research , 40 : 7 – 13 .
  • Garey , M.R. , Johnsoll , D.S. and Sethi , R. 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 : 117 – 129 .
  • Gonzalez , T. and Sahni , S. 1978 . Flowshop and Jobshop schedules: complexity and approximation . Operations Research , 26 : 36 – 52 .
  • Johnson , S.M. 1954 . Optimal two-and three-stage production schedules with setup times included . Naval Research Logistic Quarterly , 1 : 61 – 68 .
  • Lai , T.C. 1996 . A note on heuristic of flow-shop scheduling . Operations Research , 44 : 648 – 652 .
  • Nowicki , E. and Smutnicki , C. 1989 . Worst-case analysis of an approximation algorithm for flow-shop scheduling . Operations Research Letters , 8 : 171 – 177 .
  • Rinnooy Kan , A.H.G. 1976 . Machine scheduling problems: classification, complexity and computations , The Hague : Nijhoff .
  • Röck , H. and Schmidt , G. 1983 . Machine aggregation heuristics in shop scheduling . Methods of Operations Research , 45 : 303 – 314 .
  • Smutnicki , C. 1998 . Some results of the worst-case analysis for flow shop scheduling . European Journal of Operational Research , 109 : 66 – 87 .
  • Tang , H.C. 2001 . A modification to the CGPS algorithm for three-machine flow shop scheduling . Journal of Information & Optimization Sciences , 22 : 321 – 331 .
  • Tang , H.C. “ An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion ” . In Journal of Information & Optimization Sciences, to appear
  • Williamson , D.P. , Hall , L.A. , Hoogeveen , J.A. , Hurkens , C.A.J. , Lenstra , J.K. , Sevast'janov , S.V. and Shmoys , D.B. 1997 . Short shop schedules . Operations Research , 45 : 288 – 294 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.