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

Feasibility of Scheduling Lot Sizes of Three Products on One Machine

Author

Listed:
  • Celia A. Glass

    (Thames Polytechnic, London, England)

Abstract

This paper considers the Economic Lot Scheduling Problem: that is, the problem of finding a feasible schedule that allows cyclic production of several products on a single facility so as to minimize holding and set up costs. We consider the case when three products are required to be produced in a given fixed lot size and at regular intervals. We derive a very simple test for existence of a feasible schedule and a method of constructing feasible schedules if one exists. The approach is simpler than the mixed integer programming approach and enumeration schemes currently proposed in the literature and is constructive.

Suggested Citation

  • Celia A. Glass, 1992. "Feasibility of Scheduling Lot Sizes of Three Products on One Machine," Management Science, INFORMS, vol. 38(10), pages 1482-1494, October.
  • Handle: RePEc:inm:ormnsc:v:38:y:1992:i:10:p:1482-1494
    DOI: 10.1287/mnsc.38.10.1482
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.38.10.1482
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.38.10.1482?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. Amotz Bar-Noy & Randeep Bhatia & Joseph (Seffi) Naor & Baruch Schieber, 2002. "Minimizing Service and Operation Costs of Periodic Scheduling," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 518-544, August.
    2. Shoshana Anily & Julien Bramel, 2000. "Periodic Scheduling with Service Constraints," Operations Research, INFORMS, vol. 48(4), pages 635-645, August.
    3. 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.
    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.
    5. Khoury, B. N. & Abboud, N. E. & Tannous, M. M., 2001. "The common cycle approach to the ELSP problem with insufficient capacity," International Journal of Production Economics, Elsevier, vol. 73(2), pages 189-199, September.

    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:38:y:1992:i:10:p:1482-1494. 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.