New MILP models for the permutation flowshop problem

Journal of the Operational Research Society

Volumn 59, Issue 10, 2008, Pages 1373-1386

  Tseng, F T ^a   Stafford Jr , E F ^a  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Computational analysis; Integer programming; Scheduling; Sequencing

Indexed keywords

OPERATIONS RESEARCH; RESEARCH; SCHEDULING;

COMPETING MODELS; COMPUTATIONAL ANALYSIS; FLOW SHOP PROBLEMS; FLOW-SHOPS; MIXED INTEGER LINEAR PROGRAMMING MODEL; PERMUTATION FLOW SHOPS; SEQUENCING; VARIABLE SUBSTITUTION;

INTEGER PROGRAMMING;

EID: 51349105242     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602455     Document Type: Article

References (22)

1. Baker KR (1974). Introduction to Sequencing and Scheduling. John Wiley & Sons: New York.
2. Chen B, Potts CN and Woeginger GJ (1998). A review of machine scheduling: Complexily, algorithms and applications. In: Du D-Z and Du Pardalos PM (eds). Handbook of Combinatorial Optimization. Kluwer: Dordrecht: Netherlands, pp 21-169.
3. Conway RW, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison-Wesley: Massachusetts.
4. Dudek RA and Teuton OF (1964). Development of M-stage decision rule for scheduling n jobs through M machines. Opns Res 12: 471-497.
5. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: San Francisco.
6. Gupta JND (1979). A review of flowshop scheduling research. In: Ritzman LP, Krajewski LJ, Berry WL, Goodman ST, Hardy ST and Vitt LD (eds). Disaggregation: Problems in Manufacturing and Service Organizations. Martinus Nijhoff: The Hague: Netherlands, pp 363-387.
7. Gupta JND and Stafford EF (2006). Flowshop scheduling research after live decades. Eur J Opt Res 169: 699-711.
8. Hollander M and Wolfe DA (1973). Nonparametric Statistical Methods. John Wiley & Sons: New York.
9. Johnson SM (1954). Optimal Iwo- and three-stage production schedules with set-up times included. Naval Res Logist Q 1: 61-68.
10. Lawler EL, Lcnstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: Algorithms and complexity. In: Graves SC, Rinnooy Kan AHO and Zipkin PH (eds). Logistics of Production and Inventory. North-Holland: Amsterdam, pp 445-522.
11. LINDO Systems Inc., LINDO Callable Library User's Manual. LINDO Systems Inc: Chicago.
12. Manne AS (1960). On the job-shop scheduling problem. Opts Res 8: 219-223.
13. Pan CH (1997). A study of integer programming formulations for scheduling problems. Int J Syst Sci 28: 33-41.
14. Srikar BN and (Gosh S (1986). A MILP model for the N-job M-stage flowshop with sequence dependent setup times. Int J Prod Res 24: 19-1474.
15. Stafford EF (1988). On the development of a mixed-integer linear programming model for the flowshop sequencing problem. J Opl Res Soc 39: 1163-1174.
16. Stafford EF and Tseng FT (1990). On the Srikar-Ghosh MILP model for the N × M SDST flowshop problem. Int J Prod Res 28: 1817-1830.
17. Stafford EF and Tseng FT (2002). Two models for a family of flowshop sequencing problems. Eur J Opl Res 142: 282-293.
18. Stafford EF, Tseng FT and Gupta JND (2005). Comparative evaluation of MILP flowshop models. J Opl Res Soc 56: 88-101.
19. Tseng FT and Stafford EF (2001). Two MILP models for the N × M SDST flowshop sequencing problem. Int J Prod Res 39: 1777-1809.
20. Turner S and Booth D (1986). A new integer programming model for the N job M machine flow shop problem. In: Schniederjans MJ (ed). Proceedings of the Midwest Decision Science Institute, Lincoln, Nebraska, IL, p 229.
21. Wagner HM (1959). An integer linear-programming model for machine scheduling. Naval Res Login Q 6: 131-140.
22. Wilson JM (1989). Alternative formulations of a flow-shop scheduling problem. J Opl Res Soc 40: 395-399.