Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

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

R. R. Vemuganti
Management Science
Vol. 24, No. 15 (Nov., 1978), pp. 1668-1673
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2630682
Page Count: 6
  • Download ($30.00)
  • Cite this Item
On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
1668
    1668
  • Thumbnail: Page 
1669
    1669
  • Thumbnail: Page 
1670
    1670
  • Thumbnail: Page 
1671
    1671
  • Thumbnail: Page 
1672
    1672
  • Thumbnail: Page 
1673
    1673