On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine

R. R. Vemuganti
Additional contact information
R. R. Vemuganti: University of Baltimore

Management Science, 1978, vol. 24, issue 15, 1668-1673

Abstract: We are concerned with scheduling several products that, require processing or a single machine. Routine application of the economic lot size formula to each product separately, often yields an infeasiable schedule in the sense that there are times when it specifies simultaneous production of two or more products. Feasibility is guaranteed if a common cycle length (and thus equal set-ups per year per product) is chosen. However it is possible to find schedules by allowing variations in the number of set-ups among the products which cost less than the cost of the common cycle length schedule. In this paper we present a necessary and sufficient condition for the feasibility of scheduling two products, when the number of set-ups for each product are givers. Also a method of constructing the schedules is discussed.

Keywords: production/scheduling; inventory/production: deterministic models (search for similar items in EconPapers)
Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.15.1668 (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:15:p:1668-1673

Access Statistics for this article

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