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

On the Complexity of Scheduling with Batch Setup Times

Author

Listed:
  • Clyde L. Monma

    (Bell Communications Research, Morristown, New Jersey)

  • Chris N. Potts

    (University of Southampton, Southampton, England)

Abstract

Many practical scheduling problems involve processing several batches of related jobs on common facilities where a setup time is incurred whenever there is a switch from processing a job in one batch to a job in another batch. We extend various scheduling models to include batch setup times. The models include the one-machine maximum lateness, total weighted completion time, and number of late jobs problems. In all these cases, a dynamic programming approach results in an algorithm that is polynomially bounded in the number of jobs, but is exponential in the number of batches. We also study the parallel machine model with preemption and show that the maximum completion time, maximum lateness, total weighted completion time, and number of late jobs problems are NP-hard, even for the case of two identical parallel machines, and sequence independent setup times.

Suggested Citation

  • Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:5:p:798-804
    DOI: 10.1287/opre.37.5.798
    as

    Download full text from publisher

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

    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:37:y:1989:i:5:p:798-804. 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.