Skip to main content
SpringerLink
Log in

Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time

  • Conference paper
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

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

Abstract

This paper considers the single machine scheduling problem with an operator non-availability period. The operator non-availability period is an open time interval in which a job may neither start nor complete. The objective is to minimize the total completion time. The problem is NP-hard. We present an algorithm with a tight worst-case ratio of 20/17.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flow-time scheduling with a single breakdown. Acta Inform. 26, 679–696 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brauner, N., Finke, G., Lebacque, V., Rapine, C., Potts, C., Strusevich, V.: Operator non-availability periods. 4OR: Q. J. Oper. Res. 7, 239–253 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Breit, J., Schmidt, G., Strusevich, V.A.: Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Meth. Oper. Res. 34, 217–234 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kacem, I., Mahjoub, A.R.: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput. Ind. Eng. 56, 1708–1712 (2009)

    Article  Google Scholar 

  5. Kellerer, H., Strusevich, V.A.: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica 57, 769–795 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lee, C.Y.: Machine scheduling with an availability constraint. J. Global. Optim. 9, 363–382 (1996)

    Article  MathSciNet  Google Scholar 

  7. Lee, C.Y., Liman, S.D.: Single machine flow-time scheduling with scheduled maintenance. Acta Inform. 29, 375–382 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sadfi, C., Penz, B., Rapine, C., Blazewicz, J., Formanowicz, P.: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur. J. Oper. Res. 161, 3–10 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, 310027, P.R. China

    Yong Chen, An Zhang & Zhiyi Tan

Authors
  1. Yong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. An Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhiyi Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Purdue University, 305 North University Street, 47907, West Lafayette, IN, USA

    Mikhail Atallah

  2. Department of Computer Science, Illinois Institute of Technology, 60616, Chicago, IL, USA

    Xiang-Yang Li

  3. Department of Computer Science, Montana State University, EPS 357, 59717, Bozeman, MT, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Zhang, A., Tan, Z. (2011). Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time. In: Atallah, M., Li, XY., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 6681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21204-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21204-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21203-1

  • Online ISBN: 978-3-642-21204-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation