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

Some Optimum Algorithms for Scheduling Problems with Changeover Costs

Author

Listed:
  • T. C. Hu

    (University of California, San Diego, La Jolla, California)

  • Y. S. Kuo

    (National Chiao Tang University, Hsinchu, Taiwan)

  • F. Ruskey

    (University of Victoria, Victoria, British Columbia)

Abstract

We consider a production line that can produce one of n items per day. The demand schedule for all items is known in advance, and all items must be produced on or before their deadlines. We want a production schedule that meets all demand deadlines and minimizes the total changeover cost. The changeover cost has a special structure: it is (i) one dollar if the production line changes from producing item i to item j and i is less than j , and (ii) zero if i is greater than or equal to j . We also consider multiple identical production lines with all demands due at the end of every month, and assume that there is exactly enough demand at the end of every month. We obtain optimum production schedules for both the single-line and multiple-line case.

Suggested Citation

  • T. C. Hu & Y. S. Kuo & F. Ruskey, 1987. "Some Optimum Algorithms for Scheduling Problems with Changeover Costs," Operations Research, INFORMS, vol. 35(1), pages 94-99, February.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:1:p:94-99
    DOI: 10.1287/opre.35.1.94
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.1.94
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.1.94?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. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Hegde, GG & Kalathur, S & Tadikamalla, PR & Maurer, J & Abraham, KP, 1998. "Production Scheduling on Parallel Machines: a Case Study," Omega, Elsevier, vol. 26(1), pages 63-73, February.
    3. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    4. Ishwar Murthy, 1993. "Solving the multiperiod assignment problem with start‐up costs using dual ascent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 325-344, April.
    5. Mütze, Torsten, 2014. "Scheduling with few changes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 37-50.

    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:35:y:1987:i:1:p:94-99. 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.