IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v59y2004i2p193-203.html
   My bibliography  Save this article

An exact algorithm for scheduling identical coupled tasks

Author

Listed:
  • Dino Ahr
  • József Békési
  • Gábor Galambos
  • Marcus Oswald
  • Gerhard Reinelt

Abstract

The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases depending on the lengths a i and b i of the two subtasks and the delay time L i . [InlineMediaObject not available: see fulltext.][InlineMediaObject not available: see fulltext.]-hardness proofs or polynomial algorithms were given for all cases except for the one where a i =a, b i =b and L i =L. In this paper we present an exact algorithm for this problem with time complexity O(nr 2L ) where [InlineMediaObject not available: see fulltext.] holds. Therefore the algorithm is linear in the number of jobs for fixed L. Copyright Springer-Verlag 2004

Suggested Citation

  • Dino Ahr & József Békési & Gábor Galambos & Marcus Oswald & Gerhard Reinelt, 2004. "An exact algorithm for scheduling identical coupled tasks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(2), pages 193-203, June.
    • Handle: RePEc:spr:mathme:v:59:y:2004:i:2:p:193-203
    DOI: 10.1007/s001860300328
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860300328
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860300328?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. József Békési & Gábor Galambos & Michael Jung & Marcus Oswald & Gerhard Reinelt, 2014. "A branch-and-bound algorithm for the coupled task problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(1), pages 47-81, August.
    2. Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2020. "Coupled task scheduling with exact delays: Literature review and models," European Journal of Operational Research, Elsevier, vol. 282(1), pages 19-39.
    3. Békési, József & Dósa, György & Galambos, Gábor, 2022. "A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays," European Journal of Operational Research, Elsevier, vol. 297(3), pages 844-852.
    4. Bo Chen & Xiandong Zhang, 2021. "Scheduling coupled tasks with exact delays for minimum total job completion time," Journal of Scheduling, Springer, vol. 24(2), pages 209-221, April.
    5. Nazim Sami & Karim Amrouche & Mourad Boudhar, 2024. "New efficient algorithms for the two-machine no-wait chain-reentrant shop problem," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.
    6. Nadjat Meziani & Ammar Oulamara & Mourad Boudhar, 2019. "Two-machine flowshop scheduling problem with coupled-operations," Annals of Operations Research, Springer, vol. 275(2), pages 511-530, April.
    7. Karim Amrouche & Mourad Boudhar & Mohamed Bendraouche & Farouk Yalaoui, 2017. "Chain-reentrant shop with an exact time lag: new results," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 285-295, January.
    8. Mostafa Khatami & Amir Salehipour, 2021. "Coupled task scheduling with time-dependent processing times," Journal of Scheduling, Springer, vol. 24(2), pages 223-236, April.

    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:spr:mathme:v:59:y:2004:i:2:p:193-203. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.