Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure

L. Gelders and P. R. Kleindorfer
Additional contact information
L. Gelders: Katholieke Universiteit Leuven, Louvain, Belgium
P. R. Kleindorfer: International Institute of Management, Berlin, and the University of Pennsylvania, Philadelphia, Pennsylvania

Operations Research, 1975, vol. 23, issue 2, 312-324

Abstract: A previous research report of the authors presented a formal model of the one-machine job-shop scheduling problem with variable labor capacity. This report presents some computational experience with the algorithm proposed previously and a discussion of the structural aspects of the problem. Extensions and refinements of the algorithm are introduced to deal with nonsimultaneous job arrivals and the production smoothing problem. These results provide insight into the structure of the aggregate-detailed cost trade-off problem and suggest a good heuristic decision rule for problems of realistic size and complexity.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.2.312 (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:23:y:1975:i:2:p:312-324

Access Statistics for this article

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