Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources

E. F. Peter Newson
Additional contact information
E. F. Peter Newson: The University of Western Ontario

Management Science, 1975, vol. 21, issue 10, 1186-1193

Abstract: The multi-item lot size problem has been a formal management issue for some decades. The lot size decision of how much to produce (and when) usually considers the trade-off between lost productivity from frequent set-ups and short runs and the higher inventory costs arising from longer runs. When the decision must also consider shared limited production resources, the problem becomes complex. The paper is presented in two parts. Part I outlines a heuristic for solving the multi-item lot size problem given fixed production resources. The problem is initially structured as a network of unlimited capacity. An arc-cutting criterion is suggested, successively paring the unconstrained lot size optimum in low-cost increments until a feasible integer solution occurs. In Part II of this 2 part paper, the heuristic is extended to include variable capacity constraints. Computational results for both the fixed and variable capacity configurations and the bibliography conclude the presentation.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.10.1086 (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:21:y:1975:i:10:p:1186-1193

Access Statistics for this article

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