On 'redundant' constraints in Stafford's MILP model for the flowshop problem

Journal of the Operational Research Society

Volumn 54, Issue 10, 2003, Pages 1102-1105

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

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Combinatorial analysis; Integer programming; Optimization; Scheduling; Sequencing

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; OPTIMIZATION; SCHEDULING;

COMBINATORIAL ANALYSIS; FLOWSHOP PROBLEM; MIXED INTEGER LINEAR PROGRAMMING;

OPERATIONS RESEARCH;

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

References (9)

1. 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.
2. Liao CK (1993). Minimizing the number of machine idle intervals with minimum makespan in a flowshop. J Opl Res Soc 44: 817-824.
3. Wagner HM (1959). An integer linear-programming model for machine scheduling. Nav Res Log Q 6: 131-140.
4. Conway RW, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison-Wesley: Reading, MA.
5. Baker KR (1974). Introduction to Sequencing and Scheduling. Wiley: New York.
6. International Business Machines (1979). Mathematical Programming System Extended/370 Program Reference Manual. IBM Corporation: Paris, France.
7. Stafford EF and Tseng FT (2002). Two models for a family of flowshop sequencing problems. Eur J Opl Res 142: 282-293.
8. Tseng FT and Stafford EF (2001). Two MILP models for the N × M SDST flowshop sequencing problem. Int J Prod Res 28: 1817-1830.
9. LINDO Systems, Inc. (1999). LINDO Users Manual. LINDO Systems Inc.: Chicago.