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

被引：6

作者：

Stafford, EF ^{[1
]}

Tseng, FT ^{[1
]}

机构：

[1] Univ Alabama, Dept Econ & Finance, Huntsville, AL 35899 USA

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2003年 / 54卷 / 10期

关键词：

sequencing; scheduling; integer programming; combinatorial analysis; optimization;

D O I：

10.1057/palgrave.jors.2601615

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper investigates a claim that the 1988 Stafford mixed-integer linear programming model for the flowshop with permutation schedules contained a set of redundant constraints that could be eliminated without loss of model feasibility. This claim is shown to be incorrect mathematically and through the use of a counterexample problem. Eight additional problems were solved to confirm these findings.

引用

页码：1102 / 1105

页数：4

共 9 条

[1] Baker KR., 1974, Introduction to Sequencing and Scheduling
[2] Conway R.W., 1967, Theory of Scheduling
[3] LIAO CJ, 1993, J OPER RES SOC, V44, P817, DOI 10.2307/2583893
[4] *LINDO SYST INC, 1999, LINDO US MAN
[5] Two models for a family of flowshop sequencing problems
Stafford, EF
Tseng, FT
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 142 (02) : 282 - 293
[6] ON THE DEVELOPMENT OF A MIXED-INTEGER LINEAR-PROGRAMMING MODEL FOR THE FLOWSHOP SEQUENCING PROBLEM
STAFFORD, EF
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (12) : 1163 - 1174
[7] TSENG FT, 2001, INT J PROD RES, V28, P1817
[8] Wagner H.M., 1959, NAV RES LOGIST Q, P131, DOI DOI 10.1002/NAV.3800060205
[9] 1979, MATH PROGRAMMING SYS

← 1 →