A study of integer programming formulations for scheduling problems

References

• APPLEGATE , D. , and COOK , W. , 1991 , A computational study of the job-shop scheduling problem . ORSA Journal on Computing , 3 , 149 – 156 .
   Google Scholar
• ASHOUR , S. , 1970 , An experimental investigation and comparative evaluation of flowshop scheduling techniques . Operations Research , 18 , 541 – 548 .
   Web of Science ®Google Scholar
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling ( New York : Wiley ); 1975, A comparative study of flow-shop algorithms. Operations Research, 23, 62–73 .
   Google Scholar
• BAKER , K. R. , and MARTIN , J. B. , 1974 , An experimental comparison of solution algorithms for the single-machine tardiness problem . Naval Research Loyistics Quarterly , 21 , 187 – 199 .
   Google Scholar
• BLAZEWICZ , J. , DROR , M. , and WEGLARZ , J. , 1991, Mathematical programming formulations for machine scheduling: a survey. Europeall Journal of Operations Research , 51, 283–300.
   Web of Science ®Google Scholar
• BOWMAN , E. H. , 1959 , The scheduling-sequence problem . Operatiolls Research 7 , 621 – 624 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. and GUPTA , M. C. ; 1989 , Survey of scheduling research involving due date determination decisions . European Journal of Operations Research , 38 , 156 – 166 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. , and SIN , C. C. S. , 1990 , A state-of-the-art review of parallel-machine scheduling research . European Journal of Operations Research . 47 , 271 – 292 .
   Web of Science ®Google Scholar
• CONWAY , R. W. , MAXWELL , W. L. , and MILLER , L. W. , 1967 , Theory of Schedulillg ( Reading , Massachusetts , U.S.A. : Addison-Wesley ).
   Google Scholar
• CROWDER , H. , JOHNSON , E. L. , and PADBERG , M. 1983 , Solving large-scale zero-one linear programming problems . Operations Research , 31 , 803 – 834 .
   Web of Science ®Google Scholar
• FRENCH , S. , 1982 , Sequencing and Scheduling: an introduction to the Mathematics of the Job-Shop ( Chichester , U.K. : Ellis Horwood ).
   Google Scholar
• GRAHAM , R. L. , LAWLER , E. L. , LENSTRA , J. K. , and RINNOOY KAN , A. H. G. , 1979 , Optimization and approximation in deterministic sequencing and scheduling: a survey , Annals of Discrete Mathematics , 5 . 287 – 326 .
   Google Scholar
• GRAVES , S. C. , 1981 , A review of production scheduling . Operations Research . 29 , 646 – 676 .
   Web of Science ®Google Scholar
• LAWLER , E. L. , LENSTRA , J. K. , and RINNOOY KAN , A. H. G. , 1982 , Recent developments in deterministic sequencing and scheduling: a survey . In Deterministic and Stochastic Scheduling . edited by M. A. H. DUMPSTER, J. K. LENSTRA, and A. H. G. RINNOOY KAN ( Dordrecht , The Netherlands : Reidel ), pp. 35 – 74 .
   Google Scholar
• LIAO , C. L. , 1993 , Minimizing the number of machine idle intervals with minimum makespan in a flowshop , Journal of Operational Research Society , 44 , 817 – 824 .
   Web of Science ®Google Scholar
• LIAO , C. L. , and YOU , C. T. , 1992 . An improved formulation for the job-shop scheduling problem . Journal of Operauoncd Research Society , 43 , 1047 – 1954 .
   Web of Science ®Google Scholar
• LIAO , C. L. , SUN , C. L. , and YOU , W. C. , 1995 , Flow-shop scheduling with flexible processors . Computers and Operations Research , 22 , 297 – 306 .
   Web of Science ®Google Scholar
• MANNE , A. S. , 1960 , On the job-shop scheduling problem . Operations Research , 8 , 219 – 223 .
   Web of Science ®Google Scholar
• MORTEN , T. E. , and PENTICO , D. W. , 1993 , Heuristic Scheduling Systems ( New York : Wiley ).
   Google Scholar
• PANWALKAR , S. S. , and ISKANDER , W. , 1977 , A survey of scheduling rules . Operations Research , 25 , 45 – 61 .
   Web of Science ®Google Scholar
• RAVINDRAN , A. , PHILLIPS , D. T. , and SOLBERG , J. J. , 1987 , Operations Research: Principles and Practice . second edition ( New York : Wiley ).
   Google Scholar
• RINNOOY KAN , A. H. G. , 1976 . Machine Schedulinq Problem: Classification, Complexity and Computations (The Hague , Holland : Martinus Nijhoff ).
   Google Scholar
• Rodammer , F. A. , and WHITE , K. P. , 1988 , A recent survey of production scheduling . IEEE Transactions on Systems, Man and Cybernetics , 18 , 841 – 851 .
   Web of Science ®Google Scholar
• SELEN , W. J. , and HOTT , D. D. , 1988 , A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem . Journal of Operational Research Society , 37 , 1121 – 1128 .
   Web of Science ®Google Scholar
• STAFFORD , E. F. , 1988 , On the development or a mixed-integer linear programming model for the flowshop sequencing problem . Journal of Operational Research Society , 39 , 1163 – 1174 .
   Web of Science ®Google Scholar
• VAN ROY , T. J. , and WOLSEY , L. A. , 1987 , Solving mixed integer programming problems using automatic reformulation . Operations Research , 35 , 45 – 57 .
   Web of Science ®Google Scholar
• WAGNER , H. M. , 1959 , An integer linear-programming model for machine scheduling . Naval Research Logistics Quarterly , 6 , 131 – 140 .
   Google Scholar
• WILSON , J. M. , 1989 , Alternative formulations of a flow-shop scheduling problem . Journal of Operational Research Society , 40 , 395 – 399 .
   Web of Science ®Google Scholar