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

An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling Problem

Author

Listed:
  • C. Loren Doll

    (University of British Columbia)

  • D. Clay Whybark

    (Harvard Business School)

Abstract

Most of the procedures that have been developed to find solutions to the single-machine, multi-product lot scheduling problem depend on judgment to define the desirable frequencies of production for the products. In this paper we describe an iterative procedure for directly determining near optimal frequencies of production for the products and the associated fundamental cycle time which, in many cases, can be used directly for constructing production schedules. In cases where feasible schedules cannot be constructed using the values from the iterative procedure, the procedure provides a basis for changing the production frequencies and the fundamental cycle time to obtain feasible schedules.

Suggested Citation

  • C. Loren Doll & D. Clay Whybark, 1973. "An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling Problem," Management Science, INFORMS, vol. 20(1), pages 50-55, September.
    • Handle: RePEc:inm:ormnsc:v:20:y:1973:i:1:p:50-55
    DOI: 10.1287/mnsc.20.1.50
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.20.1.50
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.20.1.50?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:20:y:1973:i:1:p:50-55. 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.