Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Combinatorial Optimization

ISCO 2014: Combinatorial Optimization pp 305–314Cite as

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

  • Conference paper
  • First Online:

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

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-availability 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 the elaboration of the first FPTAS for the operator non-availability interval case. The two FPTAS are strongly polynomial.

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. Brauner, N., Finke, G., Kellerer, H., Lebacque, V., Rapine, C., Potts, C., Strusevich, V.: Operator non-availability periods. 4 OR-Q. J. Oper. Res. 7, 239–253 (2009)

    Article  MATH  Google Scholar 

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

    Article  MATH  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  MATH  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  MATH  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  MATH  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  MATH  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. 2011 (2010). doi:10.1016/j.dam.2011.07.005

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. 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  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work has been funded by the CONSEIL GENERAL DE LORRAINE: “opération réalisée avec le concours financier du Conseil Régional de Lorraine”.

Author information

Authors and Affiliations

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

    Imed Kacem & Maryam Seifaddini

  2. ISOR, University of Graz, 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

  3. Maryam Seifaddini
    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. Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  2. Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

  3. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub

  4. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis T. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kacem, I., Kellerer, H., Seifaddini, M. (2014). Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation