Skip to main content
SpringerLink
Log in

Scheduling with Fixed Compulsory Maintenance Periods

  • Chapter
  • First Online:
Scheduling with Time-Changing Effects and Rate-Modifying Activities

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 243))

  • 603 Accesses

Abstract

A large volume of research address scheduling models in which a machine is not permanently available but may become non-available for processing during one or more given intervals.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

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

    Article  Google Scholar 

  • Breit J (2007) Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. Eur J Oper Res 183:516–524

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Epstein L, Levin A, Marchetti-Spaccamela A, Megow N, Mestre J, Skutella M, Stougie L (2012) Universal sequencing on an unrelaible machine. SIAM J Comput 41:565–586

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Ji M, He Y, Cheng TCE (2007) Single-machine scheduling with periodic maintenance to minimize makespan. Comp Oper Res 34:1764–1770

    Article  Google Scholar 

  • Kacem I (2008) Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput Industr Eng 54:401–410

    Article  Google Scholar 

  • Kacem I, Chu C (2008) Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur J Oper Res 187:1080–1089

    Article  Google Scholar 

  • Kacem I, Mahjoub AR (2009). Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput Industr Eng 56:1708–1712; see also Kacem I, Mahjoub AR (2011) Erratum, Comput Industr Eng 61:1351

    Google Scholar 

  • Kellerer H, Kubzin MA, Strusevich VA (2009) Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. Eur J Oper Res 199:111–116

    Article  Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin

    Book  Google Scholar 

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

    Article  Google Scholar 

  • Kellerer H, Strusevich VA (2012) The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR - Quart J. Oper Res 10:111–161

    Article  Google Scholar 

  • Kellerer H, Strusevich VA (2016) Optimizing the Half-Product and related quadratic Boolean functions: approximation and scheduling applications. Ann Oper Res 240:39–94

    Google Scholar 

  • Lee C-Y (1996) Machine scheduling with an availability constraint. J Glob Opti 9:395–416

    Article  Google Scholar 

  • Lee C-Y (2004) Machine scheduling with availability constraints. In Leung JY-T(ed) Handbook of scheduling: algorithms, models and performance analysis. Chapman & Hall/CRC, London, pp. 22-1–22-13

    Google Scholar 

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

    Article  Google Scholar 

  • Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Comput Industr Eng 58:199–211

    Article  Google Scholar 

  • Megow N, Verschae J (2009) Short note on scheduling on a single machine with one non-availability period. Matheon, Preprint 557

    Google Scholar 

  • Sadfi C, Penz B, Rapin C, BÅ‚až ewicz J, Formanowicz P (2005) An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur J Oper Res 161: 3–10

    Google Scholar 

  • Simchi-Levi D (1994) New worst-case results for the bin packing problem. Naval Res Log 41:579–585

    Google Scholar 

  • Wang G, Sun H, Chu C (2005) Preemptive scheduling with availability constraints to minimize total weighted completion times. Ann Oper Res 133:183–192

    Article  Google Scholar 

  • Yu X, Zhang Y, Steiner G (2014)  Single-machine scheduling with periodic maintenance to minimize makespan revisited. J Sched 17:263–270

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, University of Greenwich, London, UK

    Vitaly A. Strusevich & Kabir Rustogi

  2. Delhivery Logistics Pvt. Ltd., New Delhi, India

    Kabir Rustogi

Authors
  1. Vitaly A. Strusevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kabir Rustogi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vitaly A. Strusevich .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Strusevich, V.A., Rustogi, K. (2017). Scheduling with Fixed Compulsory Maintenance Periods. In: Scheduling with Time-Changing Effects and Rate-Modifying Activities. International Series in Operations Research & Management Science, vol 243. Springer, Cham. https://doi.org/10.1007/978-3-319-39574-6_13

Download citation

Publish with us

Policies and ethics

Search

Navigation