Note--On "Production Runs for Multiple Products: The Two-Product Heuristic"

Stephen C. Graves and Robert W. Haessler
Additional contact information
Stephen C. Graves: Massachusetts Institute of Technology
Robert W. Haessler: University of Michigan

Management Science, 1978, vol. 24, issue 11, 1194-1198

Abstract: The recent paper [Saipe, A. L. 1977. Production runs for multiple products: the two-product heuristic. Management Sci. 23 (12, August) 1321-1327.] by Saipe considers the single-machine multi-product lot scheduling problem, this problem is concened with the determination of run sizes for a set of products which are produced on the same machine. In the paper [Saipe, A. L. 1977. Production runs for multiple products: the two-product heuristic. Management Sci. 23 (12, August) 1321-1327.], a heuristic solution procedure, based on a solution procedure for the two-product lot scheduling problem, is proposed for the multi-product problem. The intent of this note is to raise three issues concerning the proposed heuristic procedure: (a) the optimality of the procedure for the two-product problem, (b) the performance of the procedure at full capacity for more than two products, and (c) the effectiveness of the procedure relative to alternative solution procedures.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.11.1194 (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:1978:i:11:p:1194-1198

Access Statistics for this article

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