Skip to main content
SpringerLink
Log in

An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times

  • Conference paper
  • First Online:
Advances in Optimization and Applications (OPTIMA 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1739))

Included in the following conference series:

  • 190 Accesses

Abstract

In this paper we consider the single machine scheduling problem. Each job has a release time, processing time and a delivery time. Preemption of jobs is not allowed. The objective is to minimize the time, by which all jobs are delivered. This problem is denoted by \(1|r_j,q_j|C_{\max },\) has many applications, and it is NP-hard in strong sense. The problem is useful in solving flowshop and jobshop scheduling problems. The goal of this paper is to propose a new 11/7— approximation algorithm, which runs in \(O(n\log n)\) times. To compare the effectiveness of proposed algorithms we tested random generated problems.

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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Graham, R.L., Lawner, E.L., Rinnoy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. A survey. Ann. Disc. Math. 5(10), 287–326 (1979)

    Google Scholar 

  2. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Disc. Math. 1, 343–362 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159, 135–159 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chandra, C., Liu, Z., He, J., Ruohonen, T.: A binary branch and bound algorithm to minimize maximum scheduling cost. Omega 42, 9–15 (2014)

    Article  Google Scholar 

  5. Sourirajan, K., Uzsoy, R.: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. J. Sched. 10, 41–65 (2007)

    Article  MATH  Google Scholar 

  6. Schrage, L.: Optimal solutions to resource constrained network scheduling problems ( unpublished manuscript) (1971)

    Google Scholar 

  7. Potts, C.N.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. Int. Journal 28(6), 445–462 (1980)

    MathSciNet  MATH  Google Scholar 

  8. Hall, L.A., Shmoys, D.B.: Jackson’s rule for single-machine scheduling: making a good heuristic better. Math. Oper. Res. 17(1), 22–35 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Nowicki, E., Smutnicki, C.: An approximation algorithm for a single-machine scheduling problem with release times and delivery times. Discrete Appl. Math. 48, 69–79 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)

    Google Scholar 

  11. Carlier, J.: The one machine sequencing problem. Eur. J. Oper. Res. 11, 42–47 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  12. Grabowski, J., Nowicki, E., Zdrzalka, S.: A block approach for single-machine scheduling with release dates and due dates. Eur. J. Oper. Res. 26, 278–285 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  13. McMahon, G.B., Florian, N.: On scheduling with ready times and due dates to minimize maximum lateness. Oper. Res. 23(3), 475–482 (1975)

    Article  MATH  Google Scholar 

  14. Pan, Y., Shi, L.: Branch and bound algorithm for solving hard instances of the one-machine sequencing problem. Eur. J. Oper. Res. 168, 1030–1039 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Liu, Z.: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints. Comput. Oper. Res. 37, 1537–1543 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kanet, J., Sridharan, V.: Scheduling with inserted idle time: problem taxonomy and literature review. Oper. Res. 48(1), 99–110 (2000)

    Article  Google Scholar 

  17. Grigoreva, N.: Worst-case analysis of an approximation algorithm for single machine scheduling problem. In: Proceedings of the 16th Conference on Computer Science and Intelligence Systems, vol. 25, pp. 221-225. (Annals of Computer Science and Information System; v. 25) (2021)

    Google Scholar 

  18. Grigoreva, N.: Single machine scheduling with precedence constrains, release and delivery times. In: Wilimowska, Z., Borzemski, L., Świątek, J. (eds.) ISAT 2019. AISC, vol. 1052, pp. 188–198. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-30443-0_17

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University, Universitetskaja nab. 7/9, 199034, St. Petersburg, Russia

    Natalia Grigoreva

Authors
  1. Natalia Grigoreva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natalia Grigoreva .

Editor information

Editors and Affiliations

  1. FRC CSC RAS, Moscow, Russia

    Nicholas Olenev

  2. FRC CSC RAS, Moscow, Russia

    Yuri Evtushenko

  3. University of Montenegro, Podgorica, Montenegro

    Milojica Jaćimović

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

    Michael Khachay

  5. FRC CSC RAS, Moscow, Russia

    Vlasta Malkova

  6. FRC CSC RAS, Moscow, Russia

    Igor Pospelov

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Grigoreva, N. (2022). An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times. In: Olenev, N., Evtushenko, Y., Jaćimović, M., Khachay, M., Malkova, V., Pospelov, I. (eds) Advances in Optimization and Applications. OPTIMA 2022. Communications in Computer and Information Science, vol 1739. Springer, Cham. https://doi.org/10.1007/978-3-031-22990-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22990-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22989-3

  • Online ISBN: 978-3-031-22990-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation