Skip to main content
SpringerLink
Log in
Book cover

International Conference on Discrete Optimization and Operations Research

DOOR 2016: Discrete Optimization and Operations Research pp 259–271Cite as

Approximating Coupled-Task Scheduling Problems with Equal Exact Delays

  • Conference paper
  • First Online:

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

Abstract

We consider a coupled-task single machine scheduling problem with equal exact delays and makespan as the objective function. We design a 3-approximation algorithm for the general case of this problem. We also prove that the existence of a \((1.25-\varepsilon )\)-approximation algorithm implies P = NP. The inapproximability result remains valid for the case when the processing times of the two operations of each job are equal. We prove that this case is approximable within a factor of 1.5.

This is a preview of subscription content, 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

Learn about 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  MATH  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Bekesi, 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, 47–81 (2014)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. 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. Discret. Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  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 & 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 , Novosibirsk, Russia

    Yury Kochetov

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

    Michael Khachay

  3. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Vladimir Beresnev

  4. Far Eastern Federal University , Vladivostik, Russia

    Evgeni Nurminski

  5. University of Florida , Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Ageev, A., Ivanov, M. (2016). Approximating Coupled-Task Scheduling Problems with Equal Exact Delays. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation