IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v24y1978i15p1668-1673.html
   My bibliography  Save this article

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

Author

Listed:
  • R. R. Vemuganti

    (University of Baltimore)

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.

Suggested Citation

  • R. R. Vemuganti, 1978. "On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine," Management Science, INFORMS, vol. 24(15), pages 1668-1673, November.
    • Handle: RePEc:inm:ormnsc:v:24:y:1978:i:15:p:1668-1673
    DOI: 10.1287/mnsc.24.15.1668
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.24.15.1668
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.24.15.1668?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Banerjee, Avijit, 2009. "Simultaneous determination of multiproduct batch and full truckload shipment schedules," International Journal of Production Economics, Elsevier, vol. 118(1), pages 111-117, March.
    2. Khouja, Moutaz, 1997. "The scheduling of economic lot sizes on volume flexible production systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 73-86, January.
    3. Robert R. Inman & Philip C. Jones & Guillermo M. Gallego, 1991. "Economic lot scheduling of fully loaded processes with external setups," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 699-713, October.
    4. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:24:y:1978:i:15:p:1668-1673. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.