IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v328y2023i2d10.1007_s10479-023-05322-5.html
   My bibliography  Save this article

Approximation algorithms for coupled task scheduling minimizing the sum of completion times

Author

Listed:
  • David Fischer

    (Institute for Algorithms and Complexity)

  • Péter Györgyi

    (Eötvös Loránd Research Network)

Abstract

In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several variants of this problem that are known to be $$\mathcal{N}\mathcal{P}$$ N P -hard, while also proving $$\mathcal{N}\mathcal{P}$$ N P -hardness for two variants whose complexity was unknown before. Using these results, together with constant-factor approximations for the makespan objective from the literature, we also introduce the first results on bi-objective approximation in the coupled task setting.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:328:y:2023:i:2:d:10.1007_s10479-023-05322-5
    DOI: 10.1007/s10479-023-05322-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05322-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05322-5?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. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    2. S. Bessy & R. Giroudeau, 2019. "Parameterized complexity of a coupled-task scheduling problem," Journal of Scheduling, Springer, vol. 22(3), pages 305-313, June.
    3. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2023. "Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time," European Journal of Operational Research, Elsevier, vol. 305(2), pages 594-607.
    4. 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.
    5. 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.
    6. 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.
    7. Roy D. Shapiro, 1980. "Scheduling coupled tasks," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(3), pages 489-498, September.
    8. Moustafa Elshafei & Hanif D. Sherali & J. Cole Smith, 2004. "Radar pulse interleaving for multi‐target tracking," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 72-94, February.
    9. Mostafa Khatami & Amir Salehipour, 2021. "Coupled task scheduling with time-dependent processing times," Journal of Scheduling, Springer, vol. 24(2), pages 223-236, April.
    10. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    4. 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.
    5. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    6. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    7. Balasubramanian, Hari & Fowler, John & Keha, Ahmet & Pfund, Michele, 2009. "Scheduling interfering job sets on parallel machines," European Journal of Operational Research, Elsevier, vol. 199(1), pages 55-67, November.
    8. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    9. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    10. Zhichao Geng & Jiayu Liu, 0. "Single machine batch scheduling with two non-disjoint agents and splitable jobs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    11. Yumei Huo, 2019. "Parallel machine makespan minimization subject to machine availability and total completion time constraints," Journal of Scheduling, Springer, vol. 22(4), pages 433-447, August.
    12. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
    13. R-H Huang & C-L Yang, 2009. "An algorithm for minimizing flow time and maximum earliness on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 873-877, June.
    14. Jorge M. S. Valente, 2008. "Beam search heuristics for quadratic earliness and tardiness scheduling," FEP Working Papers 279, Universidade do Porto, Faculdade de Economia do Porto.
    15. Bo Liu & Ling Wang & Ying Liu & Shouyang Wang, 2011. "A unified framework for population-based metaheuristics," Annals of Operations Research, Springer, vol. 186(1), pages 231-262, June.
    16. Gurel, Sinan & Akturk, M. Selim, 2007. "Considering manufacturing cost and scheduling performance on a CNC turning machine," European Journal of Operational Research, Elsevier, vol. 177(1), pages 325-343, February.
    17. Jorge M. S. Valente & Maria R. A. Moreira & Alok Singh & Rui A. F. S. Alves, 2009. "Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs," FEP Working Papers 312, Universidade do Porto, Faculdade de Economia do Porto.
    18. Alexander Ageev, 2020. "Approximating the 2-machine flow shop problem with exact delays taking two values," Journal of Global Optimization, Springer, vol. 76(3), pages 491-497, March.
    19. Chen, Rubing & Geng, Zhichao & Lu, Lingfa & Yuan, Jinjiang & Zhang, Yuan, 2022. "Pareto-scheduling of two competing agents with their own equal processing times," European Journal of Operational Research, Elsevier, vol. 301(2), pages 414-431.
    20. Zhichao Geng & Jiayu Liu, 2020. "Single machine batch scheduling with two non-disjoint agents and splitable jobs," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 774-795, October.

    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:annopr:v:328:y:2023:i:2:d:10.1007_s10479-023-05322-5. 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: 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.