Abstract
In most problems considered in Chap. 13, a single machine is subject to a single compulsory maintenance, and the start time s of the compulsory maintenance period (CMP) and its duration \(\Delta \) are fixed. In this chapter, we also consider single machine scheduling problems with maintenance activities; however, now, the location of a maintenance period (MP) is less restrictive, and in fact, it is a decision variable so that its value may affect the objective function. Unless stated otherwise, in scheduling problems discussed in this chapter, the jobs of set \(N=\left\{ 1,2,\ldots ,n\right\} \) are to be processed on a single machine.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242
Chen JS (2006) Single-machine scheduling with flexible and periodic maintenance. J Oper Res Soc 57:703–710
Chen JS (2008) Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. Eur J Oper Res 190:90–102
Graves GH, Lee C-Y (1999) Scheduling maintenance and semiresumable jobs on a single machine. Naval Res Logist 48:845–863
Kellerer H, Strusevich VA (2010) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica 57:769–795
Kubzin MA, Strusevich VA (2005) Two-machine flow shop no-wait scheduling with machine maintenance. 4OR 3:303–313
Kubzin MA, Strusevich VA (2006) Planning machine maintenance in two-machine shop scheduling. Oper Res 54:789–800
Lee C-Y, Liman SD (1992) Single machine flow time scheduling with scheduled maintenance. Acta Inform 29:375–382
Low C, Ji M, Hsu C-J, Su C-T (2010) Minimizing the makespan in a single machine scheduling problem with flexible and periodic maintenance. Appl Math Model 34:334–342
Luo W, Chen L, Zhang G (2010) Approximation algorithms for scheduling with a variable machine maintenance. In: Algorithmic aspects of information management, Lecture notes in computer science, vol 6124, 209–219
Luo W, Cheng TCE, Ji M (2015) Single-machine scheduling with a variable maintenance activity. Comp Industr Eng 79:168–174
Mosheiov G, Sidney JB (2010) Scheduling a deteriorating maintenance activity on a single machine. J Oper Res Soc 61:882–887
Xu DH, Yin YQ, Li H (2009) A note on “scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan”. Eur J Oper Res 197:825–827
Xu DH, Yin YQ (2011) On single-machine scheduling with flexible maintenance activities. Int J Adv Manufact Technol 56:1139–1145
Yang D-L, Hung C-L, Hsu C-J (2002) Minimizing the makespan in a single machine scheduling problem with a flexible maintenance. J Chin Inst Indust Eng 19(1):63–66
Yang S-L, Ying M, Xu D-L, Yang J-B (2011) Minimizing total completion time on a single machine with a flexible maintenance activity. Comput Oper Res 38:755–770
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Strusevich, V.A., Rustogi, K. (2017). Scheduling with Flexible Maintenance. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-39574-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39572-2
Online ISBN: 978-3-319-39574-6
eBook Packages: Business and ManagementBusiness and Management (R0)