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

The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

Author

Listed:
  • Fayez Fouad Boctor

    (Institut d'Administration des Entreprises, Aix-en-Provence, France)

Abstract

In this paper, we deal with the two-product, single-machine, static demand, infinite horizon lot scheduling problem. After a quick review of the literature, the necessary and sufficient conditions for feasibility are derived without imposing any preliminary requirements. Then, an optimal solution algorithm is presented. Finally, we show that a necessary condition for the feasibility of N-product schedules is that each cycle time be an integer multiple of some basic cycle time.

Suggested Citation

  • Fayez Fouad Boctor, 1982. "The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem," Management Science, INFORMS, vol. 28(7), pages 798-807, July.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:7:p:798-807
    DOI: 10.1287/mnsc.28.7.798
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.7.798
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.7.798?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. P. C. Geng & R. G. Vickson, 1988. "Two heuristics for the economic lot scheduling problem: An experimental study," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 605-617, August.
    2. 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.
    3. Alexander Grigoriev & Vincent J. Kreuzen & Tim Oosterwijk, 2021. "Cyclic lot-sizing problems with sequencing costs," Journal of Scheduling, Springer, vol. 24(2), pages 123-135, April.
    4. Heuts, R.M.J. & Nederstigt, P. & Roebroek, W. & Selen, W.J., 1992. "Multi-product cycling with packaging in the process industry," Other publications TiSEM 533d6bbb-e61a-4e4b-a44e-1, Tilburg University, School of Economics and Management.
    5. Goncalves, JoseF. & Leachman, Robert C., 1998. "A hybrid heuristic and linear programming approach to multi-product machine scheduling," European Journal of Operational Research, Elsevier, vol. 110(3), pages 548-563, November.
    6. Seki, Yoichi & Kogure, Keiji, 1996. "Lot scheduling problem for continuous demand," International Journal of Production Economics, Elsevier, vol. 44(1-2), pages 7-15, June.
    7. Heuts, R.M.J. & Nederstigt, P. & Roebroek, W. & Selen, W.J., 1992. "Multi-product cycling with packaging in the process industry," Research Memorandum FEW 544, Tilburg University, School of Economics and Management.

    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:28:y:1982:i:7:p:798-807. 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.