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

Scheduling Unit-Time Open Shops with Deadlines

Author

Listed:
  • Thomas Tautenhahn

    (Technische Universität Otto von Guericke, Magdeburg, Germany)

Abstract

We consider open shop problems with unit processing times and due dates, where n jobs have to be processed on m machines. The order in which a given job is processed on the machines is not fixed. Such problems occur in testing components of an electronic system or doing repair work on automobiles. In an earlier paper, C. Y. Liu and R. L. Bulfin gave an O ( n 2 m ) algorithm to minimize total tardiness and the number of tardy jobs. We will give a polynomial algorithm to minimize the completion time of all jobs where a deadline is imposed for each job. The complexity of this problem is still open. Then we apply this solution to give improved algorithms to minimize the number of tardy jobs and the maximum lateness.

Suggested Citation

  • Thomas Tautenhahn, 1994. "Scheduling Unit-Time Open Shops with Deadlines," Operations Research, INFORMS, vol. 42(1), pages 189-192, February.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:1:p:189-192
    DOI: 10.1287/opre.42.1.189
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.1.189
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.1.189?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. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.

    More about this item

    Keywords

    production/scheduling: open shop;

    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:42:y:1994:i:1:p:189-192. 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.