You are not currently logged in.
Access JSTOR through your library or other institution:
On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
R. R. Vemuganti
Vol. 24, No. 15 (Nov., 1978), pp. 1668-1673
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2630682
Page Count: 6
Preview not available
We are concerned with scheduling several products that require procesing on a single machine. Routine application of the economic lot size formula to each product separately, often yields an infeasible 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 given. Also a method of constructing the schedules is discussed.
Management Science © 1978 INFORMS