IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v297y2022i3p844-852.html
   My bibliography  Save this article

A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays

Author

Listed:
  • Békési, József
  • Dósa, György
  • Galambos, Gábor

Abstract

The considered coupled task problem (CTP) is to schedule n jobs, each consisting of two (sub)tasks, on a single machine. Exact delay times are between the subtasks of a job and the makespan has to be minimized. It has been proven that the problem is strongly NP-hard in general case (see Orman and Potts (1997)), even if the lengths of the subtasks are identical. This paper considers a special case of CTP where there are jobs with two different delay times only. The complexity status of this problem is unknown. We will present an algorithm – called First Fit Decreasing (FFD) – and we will prove that its approximation ratio is in the interval (1.57894,1.57916).

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:297:y:2022:i:3:p:844-852
    DOI: 10.1016/j.ejor.2021.06.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721004999
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.06.002?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.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. Orman, A. J. & Potts, C. N. & Shahani, A. K. & Moore, A. R., 1996. "Scheduling for a multifunction phased array radar system," European Journal of Operational Research, Elsevier, vol. 90(1), pages 13-25, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. David Fischer & Péter Györgyi, 2023. "Approximation algorithms for coupled task scheduling minimizing the sum of completion times," Annals of Operations Research, Springer, vol. 328(2), pages 1387-1408, September.
    2. Epstein, Leah, 2024. "Tighter bounds for the harmonic bin packing algorithm," European Journal of Operational Research, Elsevier, vol. 316(1), pages 72-84.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Mostafa Khatami & Amir Salehipour, 2021. "Coupled task scheduling with time-dependent processing times," Journal of Scheduling, Springer, vol. 24(2), pages 223-236, April.
    3. 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.
    4. 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.
    5. 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.
    6. David Fischer & Péter Györgyi, 2023. "Approximation algorithms for coupled task scheduling minimizing the sum of completion times," Annals of Operations Research, Springer, vol. 328(2), pages 1387-1408, September.
    7. Josef Zuk & David Kirszenblat, 2024. "Explicit results for the distributions of queue lengths for a non-preemptive two-level priority queue," Annals of Operations Research, Springer, vol. 341(2), pages 1223-1246, October.
    8. Mostafa Khatami & Amir Salehipour, 2021. "A binary search algorithm for the general coupled task scheduling problem," 4OR, Springer, vol. 19(4), pages 593-611, December.
    9. Zhang, Haowei & Xie, Junwei & Ge, Jiaang & Zhang, Zhaojian & Zong, Binfeng, 2019. "A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar," European Journal of Operational Research, Elsevier, vol. 272(3), pages 868-878.
    10. Haowei Zhang & Junwei Xie & Qiyong Hu & Zhaojian Zhang & Binfeng Zong, 2019. "Online pulse interleaving task scheduling for multifunction radar," Journal of Scheduling, Springer, vol. 22(2), pages 183-192, April.
    11. Maël Guiraud & Yann Strozecki, 2024. "Scheduling periodic messages on a shared link without buffering," Journal of Scheduling, Springer, vol. 27(5), pages 461-484, October.
    12. Duron, Cyril & Proth, Jean-Marie & Wardi, Yorai, 2005. "Insertion of a random task in a schedule: a real-time approach," European Journal of Operational Research, Elsevier, vol. 164(1), pages 52-63, July.
    13. 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.
    14. 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.
    15. C N Potts & J D Whitehead, 2007. "Heuristics for a coupled-operation scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1375-1388, October.
    16. 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.

    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:eee:ejores:v:297:y:2022:i:3:p:844-852. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.