The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes

Gregory Dobson
Additional contact information
Gregory Dobson: University of Rochester, Rochester, New York

Operations Research, 1987, vol. 35, issue 5, 764-771

Abstract: This paper considers the Economic Lot Scheduling Problem: that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. We develop a formulation that provides feasible schedules by allowing the lot sizes and thus the cycle times for each product to vary over time and by explicitly taking into account setup times. Our main results characterize when feasible schedules exist, quantify the insensitivity of the schedules' costs to minor adjustments, and thus show how close the schedules will be to ones with optimal equal cycle times. We also present a heuristic for finding good feasible schedules.

Keywords: 334 multiproduct lot sizing; 581 ELSP: feasibility issues (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (37)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.5.764 (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:35:y:1987:i:5:p:764-771

Access Statistics for this article

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