An empirical analysis of integer programming formulations for the permutation flowshop

Omega

Volumn 32, Issue 4, 2004, Pages 285-293

  Tseng, Fan T ^a   Stafford, Edward F ^a   Gupta, Jatinder N D ^a  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Computational comparisons; Flowshop scheduling; Minimizing makespan; Mixed integer linear programming

Indexed keywords

EID: 1842760692     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2003.12.001     Document Type: Article

References (20)

1. Wagner H.M. An integer linear-programming model for machine scheduling Naval Research Logistics Quarterly 6 1959 131-140
2. Bowman E.H. The schedule-sequence problem Operations Research 7 1959 621-624
3. Manne A.S. On the job-shop scheduling problem Operations Research 8 1960 219-223
4. Gupta J.N.D. The generalized n-job, m-machine scheduling problem Opsearch 8 1971 173-185
5. Morten T.E. Pentico D.W. Heuristic scheduling systems 1993 Wiley New York
6. Baker K.R. Introduction to sequencing and scheduling 1974 Wiley New York
7. Stafford E.F. On the development of a mixed-integer linear programming model for the flowshop sequencing problem Journal of the Operational Research Society 39 1988 1163-1174
8. Wilson J.M. Alternative formulations of a flow-shop scheduling problem Journal of the Operational Research Society 40 1989 395-399
9. Pan C.H. A study of integer programming formulations for scheduling problems International Journal of Systems Science 28 1997 33-41
10. Liao C.L. You C.T. An improved formulation for the job-shop scheduling problem Journal of the Operational Research Society 43 1992 1047-1054
11. Tseng F.T. Stafford E.F. Two MILP models for the N× M SDST flowshop sequencing problem International Journal of Production Research 39 2001 1777-1809
12. Stafford E.F. Tseng F.T. Two models for a family of flowshop sequencing problems European Journal of Operational Research 142 2002 282-293
13. Johnson S.M. Optimal two- and three-stage production schedules with set-up times included Naval Research Logistics Quarterly 1 1954 61-68
14. Gupta JND. A review of flowshop scheduling research. In: Ritzman LJ, Krawjewski LJ, Berry WL, Goodman SM, Hardy ST, Vitt LO, editors. Disaggregation problems in manufacturing and service organizations. Hingham, MA: Martinus Nijhoff Publishers; 1979. p. 363-88.
15. Stafford E.F. Tseng F.T. On "redundant' constraints in Stafford's MILP model for the flowshop problem Journal of the Operational Research Society 54 2003 1102-1105
16. Stafford E.F. Tseng F.T. On the Srikar-Ghosh MILP model for the N× M SDST flowshop problem International Journal of Production Research 28 1990 1817-1830
17. Daniel W.W. Applied nonparametric statistics 1978 Houghton-Mifflin Company Boston
18. Rios-Mercado R.Z. Bard J.F. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups Computers and Operations Research 25 1998 351-366
19. Ignall E. Schrage L. Application of the branch-and-bound technique to some flow-shop scheduling problems Operations Research 13 1965 400-412
20. Aggarwal S.C. Stafford E.F. A heuristic algorithm for the flowshop problem with a common job sequence on all machines Decision Sciences 6 1975 237-251