A General Bounding Scheme for the Permutation Flow-Shop Problem

B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan
Additional contact information
B. J. Lageweg: Mathematisch Centrum, Amsterdam, The Netherlands
J. K. Lenstra: Mathematisch Centrum, Amsterdam, The Netherlands
A. H. G. Rinnooy Kan: Erasmus University, Rotterdam, The Netherlands

Operations Research, 1978, vol. 26, issue 1, 53-67

Abstract: Branch-and-bound methods are commonly used to find a permutation schedule that minimizes maximum completion time in an m -machine flow-shop. In this paper we describe a classification scheme for lower bounds that generates most previously known bounds and leads to a number of promising new ones as well. After a discussion of dominance relations within this scheme and of the implementation of each bound, we report on computational experience that indicates the superiority of one of the new bounds.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.53 (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:53-67

Access Statistics for this article

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