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

E F Stafford () and F T Tseng
Additional contact information
E F Stafford: University of Alabama in Huntsville
F T Tseng: University of Alabama in Huntsville

Journal of the Operational Research Society, 2003, vol. 54, issue 10, 1102-1105

Abstract: Abstract 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.

Keywords: sequencing; scheduling; integer programming; combinatorial analysis; optimization (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601615 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:54:y:2003:i:10:d:10.1057_palgrave.jors.2601615

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601615

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().