Comparative evaluation of MILP flowshop models

Journal of the Operational Research Society

Volumn 56, Issue 1, 2005, Pages 88-101

  Stafford Jr , E F ^a   Tseng, F T ^a   Gupta, J N D ^a  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Empirical evaluation; Flowshop scheduling; Integer programming; Manne models; Model complexity; Wagner models

Indexed keywords

COMPUTER SYSTEMS; CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMAL SYSTEMS; PROBLEM SOLVING; SCHEDULING;

EMPIRICAL EVALUATION; FLOWSHOP SCHEDULING; MANNE MODELS; MODEL COMPLEXITY; WAGNER MODELS;

LINEAR PROGRAMMING;

EID: 12144257206     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601805     Document Type: Article

References (35)

1. Johnson SM (1954). Optimal two- and three-stage production schedules with set-up times included. Nav Res Log Q 1: 61-68.
2. Gupta JND (1979). A review of flowshop scheduling research. In: Ritzman LP et al (eds). Disaggregation: Problems in Manufacturing and Service Organizations. Martinus Nijhoff, The Hague, Netherlands, pp 363-387.
3. Chen B. Potts CN and Woeginger GJ (1998). A review of machine scheduling: complexity, algorithms and applications. In: Du D-Z and Du Pardalos PM (eds). Handbook of Combinatorial Optimization. Kluwer, Dordrecht, Netherlands, pp 21-169.
4. Garey MR and Johnson DS (1979). Computers and Intract-ability: A Guide to the Theory of HP-Completeness. Freeman: San Francisco.
5. Lawler EL. Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds) Logistics of Production and Inventory. North-Holland. Amsterdam, Netherlands, pp 445-522.
6. Wagner HM (1959). An integer linear-programming model for machine scheduling. Nav Res Log Q 6: 131-140.
7. Bowman EH (1959). The schedule-sequence problem. Opns Res 7: 621-624.
8. Manne AS (1960). On the job-shop scheduling problem. Opns Res 8: 219-223.
9. Baker K.R (1974). Introduction to Sequencing and Scheduling. Wiley: New York.
10. 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.
11. Stafford EF (1983). A mixed-integer linear programming model for the classical flowshop sequencing problem. Working paper, University of South Carolina.
12. Stafford EF and Tseng FT (2002). Two models for a family of flowshop sequencing problems. Eur J Opnl Res 142: 282-293.
13. Wilson JM (1989). Alternative formulations of a flow-shop scheduling problem. J Opl Res Soc 40: 395-399.
14. Tseng FT and Stafford EF (2001). Two MILP models for the N × M SDST flowshop sequencing problem. Int J Prod Res 39: 1777-1809.
15. 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.
16. Liao CL and You CT (1992). An improved formulation for the job-shop scheduling problem. J Opl Res Soc 43: 1047-1054.
17. Pan CH (1997). A study of integer programming formulations for scheduling problems, Int J Sys Sci 28: 33-41.
18. Morten TE and Pentico DW (1993). Heuristic Scheduling Systems. Wiley: New York.
19. SCICONICIVM User Guide (1986). Scicon Limited: London.
20. Stafford EF, Gupta JND and Tseng FT (2004). Supplemental materials for a study of flow shop scheduling models. Working paper, University of Alabama in Huntsville.
21. Stafford EF and Tseng FT (2003). On 'redundant' constraints in Stafford's MILP model for the flowshop problem. J Opl Res Soc 54: 1104-1107.
22. Liao CL (1993). Minimizing the number of machine idle intervals with minimum makespan in a flowshop. J Opl Res Soc 44: 817-824.
23. Srikar BN and Ghosh S (1986). A MILP model for the job-stage flowshop with sequence dependent set-up times. Int J Prod Res 24: 1459-1474.
24. Stafford EF and Tseng FT (2001). Two MILP models for the SSIST flowshop sequencing problem. In: Rungtusanatham MJ (ed). 2001 Decision Sciences Institute Proceedings. Decision Sciences Institute, Atlanta, GA, pp. 1010-1012.
25. ILOG S A (2001). ILOG CPLEX 7.1 User's Manual. ILOG S. A: Genlilly, France.
26. LINDO Systems Inc. (1999). UNDO Users Manual. LINDO Systems Inc.: Chicago.
27. LINDO Systems, Inc. (1999). LINGO user's Guide. LINDO Systems Inc.: Chicago.
28. IBM (1979). Mathematical Programming System Extended/'370 Program Reference Manual. IBM: Paris, France.
29. Tseng FT, Stafford EF and Gupta JND (2003). An empirical analysis of integer programming formulations for the permutation flowshop. OMEGA: In J Mngt Sci 32: 285-293.
30. Hollander M and Wolfe DA (1973). Nonparametric Statistical Methods. Wiley: New York.
31. LINDO Systems Inc. (2001). LINDO Callable Library User's Manual. LINDO Systems Inc.: Chicago.
32. Aggarwal SC and Stafford EF (1975). A heuristic algorithm for the flowshop problem with a common job sequence on all machines. Dec Sci 6: 237-251.
33. Rios-Mercado RZ and Bard JF (1998). Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comp and Opns Res 25: 351-366.
34. Lageweg BJ (1978). A general bounding scheme for the permutation flow-shop. Opns Res 26: 621-624.
35. Campbell HG, Dudek RA and Smith ML (1970). A heuristic algorithm for the n job M machine sequencing problem. Mngt Sci 16: B630-B637.