Job-Shop Scheduling by Implicit Enumeration

B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan
Additional contact information
B. J. Lageweg: Mathematisch Centrum, Amsterdam
J. K. Lenstra: Mathematisch Centrum, Amsterdam
A. H. G. Rinnooy Kan: Graduate School of Management, Delft

Management Science, 1977, vol. 24, issue 4, 441-450

Abstract: The classical combinatorial optimization problem of minimizing maximum completion time in a general job-shop has been the subject of extensive research. In this paper we review and extend this work. A general bounding approach is developed which includes all previously presented lower bounds as special cases. The strongest bound obtainable in this way is combined with two enumeration schemes, the relative merits of which are discussed. The results of some computational experiments and a large bibliography are included as well.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.4.441 (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:ormnsc:v:24:y:1977:i:4:p:441-450

Access Statistics for this article

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