IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v16y1968i2p342-352.html
   My bibliography  Save this article

Minimum Change-Over Scheduling of Several Products on One Machine

Author

Listed:
  • C. R. Glassey

    (University of California, Berkeley, California)

Abstract

Given a finite horizon delivery schedule for n products we wish to schedule production on a single machine to meet deliveries and minimize the number of change-overs of the machine from one product to another. A state space is defined and in it a network is constructed such that the shortest distance through the network corresponds to the minimum number of production change-overs. Certain properties of the optimal path are deduced from the dynamic programming formulation of the shortest route problem, and these properties are utilized in the construction of an algorithm that finds the optimal path. A numerical example illustrates the method.

Suggested Citation

  • C. R. Glassey, 1968. "Minimum Change-Over Scheduling of Several Products on One Machine," Operations Research, INFORMS, vol. 16(2), pages 342-352, April.
    • Handle: RePEc:inm:oropre:v:16:y:1968:i:2:p:342-352
    DOI: 10.1287/opre.16.2.342
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.2.342
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.16.2.342?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. Blocher, James D. & Chand, Suresh, 1996. "A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 456-470, June.
    2. Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
    3. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    4. James D. Blocher & Suresh Chand & Kaushik Sengupta, 1999. "The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm," Operations Research, INFORMS, vol. 47(4), pages 559-569, August.
    5. Bruggemann, Wolfgang & Jahnke, Hermann, 2000. "The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability," European Journal of Operational Research, Elsevier, vol. 124(3), pages 511-528, August.

    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:oropre:v:16:y:1968:i:2:p:342-352. 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.