Model formulations for the machine scheduling problem with limited waiting time constraints

References

• Blazewicz , J. , Dror , M. and Weglarz , J. 1991 . Mathematical programming formulations for machine scheduling: a survey . European Journal of Operational Research , 51 : 283 – 300 .
   Web of Science ®Google Scholar
• Bouquarcd , J. L. , Billaut , J. C. , Kubzin , M. A. and Strusevich , V. A. 2005 . Two-machine flow shop scheduling problems with no-wait jobs . Operations Research Letters , 33 : 255 – 262 .
   Web of Science ®Google Scholar
• French , S. 1982 . “ Sequencing and Scheduling ” . In An introduction to the Mathematics of the Job-Shop , Chichester , U.K. : Ellis Horwood .
   Google Scholar
• Hodson , A. , Muhlemann , P. and Price , D. H. R. 1985 . A microcomputer based solution to a practical scheduling problem . Journal of the Operational Research Society , 36 : 903 – 914 .
   Web of Science ®Google Scholar
• Liao , C. L. and You , C. T. 1992 . An improved formulation for the job-shop scheduling problem . Journal of the Operational Research Society , 43 : 1047 – 1954 .
   Web of Science ®Google Scholar
• Liaw , C. Y. , Cheng , C. Y. and Chen , M. 2005 . Scheduling two-machine nowait open shops to minimize makespan . Computers and Operations Research , 32 : 901 – 917 .
   Web of Science ®Google Scholar
• Morten , T. E. and Pentico , D. W. 1993 . Heuristic Scheduling Systems , New York : Wiley .
   Google Scholar
• Pan , C. H. 1997 . A study of integer programming formulations for scheduling problems . International Journal of Systems Science , 28 : 33 – 41 .
   Web of Science ®Google Scholar
• Pinedo , M. 2002 . “ Scheduling ” . In Theory, Algorithms and Systems , New Jersey : Prentice-Hall .
   Google Scholar
• Rinnooy Kan , A. H. G. 1976 . “ Machine Scheduling Problems: Classification, Complexity and Computations ” . In Martinus Nijhoff , Holland : The Hague .
   Google Scholar
• Schuster , C. J. and Framinan , J. M. 2003 . Approximative procedures for nowait job shop scheduling . Operations Research Letters , 31 : 308 – 318 .
   Web of Science ®Google Scholar
• Su , L. H. 2003 . A hybrid two-stage flowshop with limited waiting time constraints . Computers & Industrial Engineering , 44 : 409 – 424 .
   Web of Science ®Google Scholar
• Wang , J. B. and Xia , Z. Q. 2005 . No-wait or no-idle permutation flowshop scheduling with dominating machines . Journal of Applied Mathematics and Computing , 17 : 419 – 432 .
   Google Scholar
• Wilson , J. M. 1989 . Alternative formulations of a flow-shop scheduling problem . Journal of the Operational Research Society , 40 : 395 – 399 .
   Web of Science ®Google Scholar
• Woeginger , G. J. 2004 . Inapproximability results for no-wait job shop scheduling . Operations Research Letters , 32 : 320 – 325 .
   Web of Science ®Google Scholar
• Yang , D. L. and Chern , M. S. 1995 . Two-machine flowshop sequencing problem with limited waiting time constraints . Computers & Industrial Engineering , 28 : 63 – 70 .
   Web of Science ®Google Scholar