Skip to main content
SpringerLink
Log in

An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays

  • Conference paper
  • First Online:
Book cover Mathematical Optimization Theory and Operations Research (MOTOR 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12095))

  • 644 Accesses

Abstract

We study the coupled-task single machine scheduling problem with equal exact delays and makespan as the objective function. It is known that the problem cannot be approximated with a factor better than 1.25 unless P \(=\) NP. In this paper, we present a 2.5-approximation algorithm for this problem, which improves the best previously known approximation bound of 3. The algorithm runs in time \(O(n\log n)\) where n is the number of jobs.

The work was supported by the program of fundamental scientific researches of the SB RAS, project N 0314-2019-0014.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ageev, A.A., Baburin, A.E.: Approximation algorithms for UET scheduling problems with exact delays. Oper. Res. Lett. 35, 533–540 (2007)

    Article  MathSciNet  Google Scholar 

  2. Ageev, A., Ivanov, M.: Approximating coupled-task scheduling problems with equal exact delays. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 259–271. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44914-2_21

    Chapter  Google Scholar 

  3. Ageev, A.A., Kononov, A.V.: Approximation algorithms for scheduling problems with exact delays. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 1–14. Springer, Heidelberg (2007). https://doi.org/10.1007/11970125_1

    Chapter  MATH  Google Scholar 

  4. Baptiste, P.: A note on scheduling identical coupled tasks in logarithmic time. Disc. Appl. Math. 158, 583–587 (2010)

    Article  MathSciNet  Google Scholar 

  5. Békési, J., Galambos, G., Jung, M.N., Oswald, M., Reinelt, G.: A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. 80(1), 47–81 (2014). https://doi.org/10.1007/s00186-014-0469-6

    Article  MathSciNet  MATH  Google Scholar 

  6. Blazewicz, J., Pawlak, G., Tanas, M., Wojciechowicz, W.: New algorithms for coupled tasks scheduling – a survey. RAIRO - Operations Research - Recherche Operationnelle 46, 335–353 (2012)

    Article  MathSciNet  Google Scholar 

  7. Condotta, A., Shakhlevich, N.V.: Scheduling coupled-operation jobs with exact time-lags. Discrete Appl. Math. 160, 2370–2388 (2012)

    Article  MathSciNet  Google Scholar 

  8. Farina, A., Neri, P.: Multitarget interleaved tracking for phased array radar. IEEE Proc. Part F Comm. Radar Signal Process. 127, 312–318 (1980)

    Article  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  10. Elshafei, M., Sherali, H.D., Smith, J.C.: Radar pulse interleaving for multi-target tracking. Naval Res. Logist. 51, 79–94 (2004)

    Article  MathSciNet  Google Scholar 

  11. Izquierdo-Fuente, A., Casar-Corredera, J.R.: Optimal radar pulse scheduling using neural networks. In: IEEE International Conference on Neural Networks, vol. 7, pp. 4588–4591 (1994)

    Google Scholar 

  12. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Google Scholar 

  13. Hwang, F.J., Lin, B.M.T.: Coupled-task scheduling on a single machine subject to a fixed-job-sequence. J. Comput. Ind. Eng. 60, 690–698 (2011)

    Article  Google Scholar 

  14. Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys, D.: Sequencing and scheduling: algorithms and complexity, In: Handbooks in Operations Research and Management Science, Logistics of Production and Inventory, 4, North Holland, Amsterdam, pp. 445–522 (1993)

    Google Scholar 

  15. Orman, A.J., Potts, C.N.: On the complexity of coupled-task scheduling. Discrete Appl. Math. 72, 141–154 (1997)

    Article  MathSciNet  Google Scholar 

  16. Sherali, H.D., Smith, J.C.: Interleaving two-phased jobs on a single machine. Discrete Optim. 2, 348–361 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors thank the anonymous referees for their helpful comments and suggestions.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Koptyuga 4, Novosibirsk, Russia

    Alexander Ageev

  2. Novosibirsk State University, Pirogova 2, Novosibirsk, Russia

    Mikhail Ivanov

Authors
  1. Alexander Ageev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Ageev .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Alexander Kononov

  2. Krasovsky Institute of Mathematics and Mechanics, Yekaterinburg, Russia

    Michael Khachay

  3. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A Kalyagin

  4. University of Florida, Gainesville, FL, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ageev, A., Ivanov, M. (2020). An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays. In: Kononov, A., Khachay, M., Kalyagin, V., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Lecture Notes in Computer Science(), vol 12095. Springer, Cham. https://doi.org/10.1007/978-3-030-49988-4_18

Download citation

Publish with us

Policies and ethics

Search

Navigation