On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine

Wen-Lian Hsu
Additional contact information
Wen-Lian Hsu: Northwestern University

Management Science, 1983, vol. 29, issue 1, 93-105

Abstract: Given N products and a set of "basic data" for each product, e.g., production rate, demand rate, setup time, setup cost and holding cost, etc., the Economic Lot Scheduling Problem is to find a feasible schedule that allows cyclic production pattern for each product and such that the sum of the setup and inventory carrying costs for all products per unit time is minimized. The routine application of the economic lot size formula to each product separately, often leads to the phenomenon of "interference," i.e., the machine will be required to produce two items at the same time, which is impossible. In this paper we show that even a very restricted version of the original problem becomes NP-hard. We also give an implicit enumeration procedure for testing the feasibility of a schedule in which product i is set up \eta i (integer) times per year. The main advantage of our procedure is that we can by-pass the tedious study of the start times and concentrate on the combinatorial structure of the production runs, which thus, theoretically cuts down the number of possible branchings in the enumeration.

Keywords: production/scheduling; lot sizes (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (46)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.1.93 (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:29:y:1983:i:1:p:93-105

Access Statistics for this article

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