Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem

J. N. D. Gupta and S. S. Reddi
Additional contact information
J. N. D. Gupta: U.S. Postal Service, Washington, D.C.
S. S. Reddi: W. W. Gaertner Research, Inc., Stamford, Connecticut

Operations Research, 1978, vol. 26, issue 1, 200-203

Abstract: Existing combinatorial (or elimination) approaches for solving the three-machine flowshop scheduling problem are not applicable for the situation where the jobs have their least processing time on the second machine. We present improved dominance conditions that extend the applicability of combinatorial approaches to this situation. To derive these conditions we use Johnson's two-machine results as well as the nature of unscheduled jobs.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.200 (application/pdf)

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:inm:oropre:v:26:y:1978:i:1:p:200-203

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().