Skip to main content
SpringerLink
Log in

Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2018)

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

Included in the following conference series:

Abstract

In this paper we consider the single machine scheduling problem with one non-availability interval to minimize the maximum lateness where jobs have positive tails. Two cases are considered. In the first one, the non-availability interval is due to the machine maintenance. In the second case, the non-availibility interval is related to the operator who is organizing the execution of jobs on the machine. The contribution of this paper consists in an improved FPTAS for the maintenance non-availability interval case and its extension to the operator non-availability interval case. The two FPTASs are strongly polynomial and outperform the recent ones by Kacem, Kellerer and Seifaddini presented in [12].

Supported by the LCOMS EA 7306, a research unit of the Université de Lorraine, and by the University of Graz.

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. Brauner, N., et al.: Operator non-availability periods. 4OR: Q. J. Oper. Res. 7, 239–253 (2009)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Chen, Y., Zhang, A., Tan, Z.: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Inf. Sci. 251, 150–163 (2013)

    Article  MathSciNet  Google Scholar 

  4. Dessouky, M.I., Margenthaler, C.R.: The one-machine sequencing problem with early starts and due dates. AIIE Trans. 4(3), 214–222 (1972)

    Article  Google Scholar 

  5. Gens, G.V., Levner, E.V.: Fast approximation algorithms for job sequencing with deadlines. Discret. Appl. Math. 3, 313–318 (1981)

    Article  Google Scholar 

  6. He, Y., Zhong, W., Gu, H.: Improved algorithms for two single machine scheduling problems. Theor. Comput. Sci. 363, 257–265 (2006)

    Article  MathSciNet  Google Scholar 

  7. Ibarra, O., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463–468 (1975)

    Article  MathSciNet  Google Scholar 

  8. Kacem, I.: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Comb. Optim. 17(2), 117–133 (2009)

    Article  MathSciNet  Google Scholar 

  9. Kacem, I., Kellerer, H.: Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret. Appl. Math. 164(1), 154–160 (2014)

    Article  MathSciNet  Google Scholar 

  10. Kacem, I., Kellerer, H.: Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints. Algorithmica (2018) https://doi.org/10.1007/s00453-018-0417-6

    Article  MathSciNet  Google Scholar 

  11. Kacem, I., Kellerer, H.: Semi-online scheduling on a single machine with unexpected breakdown. Theor. Comput. Sci. 646, 40–48 (2016)

    Article  MathSciNet  Google Scholar 

  12. Kacem, I., Kellerer, H., Seifaddini, M.: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J. Comb. Optim. 32, 970–981 (2016)

    Article  MathSciNet  Google Scholar 

  13. Kacem, I., Sahnoune, M., Schmidt, G.: Strongly fully polynomial time approximation scheme for the weighted completion time minimisation problem on two-parallel capacitated machines. RAIRO - Oper. Res. 51, 1177–1188 (2017)

    Article  MathSciNet  Google Scholar 

  14. Kubzin, M.A., Strusevich, V.A.: Planning machine maintenance in two machine shop scheduling. Oper. Res. 54, 789–800 (2006)

    Article  Google Scholar 

  15. Lee, C.Y.: Machine scheduling with an availability constraints. J. Glob. Optim. 9, 363–384 (1996)

    Article  MathSciNet  Google Scholar 

  16. Qi, X.: A note on worst-case performance of heuristics for maintenance scheduling problems. Discret. Appl. Math. 155, 416–422 (2007)

    Article  MathSciNet  Google Scholar 

  17. Qi, X., Chen, T., Tu, F.: Scheduling the maintenance on a single machine. J. Oper. Res. Soc. 50, 1071–1078 (1999)

    Article  Google Scholar 

  18. Rapine, C., Brauner, N., Finke, G., Lebacque, V.: Single machine scheduling with small operator-non-availability periods. J. Sched. 15, 127–139 (2012)

    Article  MathSciNet  Google Scholar 

  19. Schmidt, G.: Scheduling with limited machine availability. Eur. J. Oper. Res. 121, 1–15 (2000)

    Article  MathSciNet  Google Scholar 

  20. Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23, 116–127 (1976)

    Article  MathSciNet  Google Scholar 

  21. Yuan, J.J., Shi, L., Ou, J.W.: Single machine scheduling with forbidden intervals and job delivery times. Asia-Pac. J. Oper. Res. 25(3), 317–325 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lorraine, LCOMS EA 7306, 57000, Metz, France

    Imed Kacem

  2. Institut für Statistik und Operations Research, University of Graz, Universitätsstraße 15, 8010, Graz, Austria

    Hans Kellerer

Authors
  1. Imed Kacem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Kellerer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Imed Kacem .

Editor information

Editors and Affiliations

  1. University of Salerno, Fisciano, Italy

    Raffaele Cerulli

  2. University of Salerno, Fisciano, Italy

    Andrea Raiconi

  3. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kacem, I., Kellerer, H. (2018). Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00898-7_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00897-0

  • Online ISBN: 978-3-030-00898-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation