Scheduling Position-Dependent Maintenance Operations
Published Online:23 Oct 2017https://doi.org/10.1287/opre.2017.1659
References
- (2004) Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 55(3):257–264.Crossref, Google Scholar
- (1983) Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Oper. Res. 31(2):381–386.Link, Google Scholar
- (2003) Scheduling multiprocessor tasks on parallel processors with limited availability. Eur. J. Oper. Res. 149(2):377–389.Crossref, Google Scholar
- (2007) Handbook on Scheduling (Springer, Berlin).Google Scholar
- (1993) Reconstructing a production capability: Past experience, restart criteria, and suggested policies. Report MR-273-ACQ, RAND Corporation, Santa Monica, CA.Google Scholar
- (1999) Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115(1):173–178.Crossref, Google Scholar
- (2008) A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188(2):315–329.Crossref, Google Scholar
- (2008) Optimization models for the tool change scheduling problem. Omega 36(5):888–894.Crossref, Google Scholar
- (2016) Minimizing the total completion time on a parallel machine system with tool changes. Comput. Indust. Engrg. 91(January):290–301.Crossref, Google Scholar
- (2016) Instances for position-dependent maintenance scheduling. Accessed on September 28, 2017, http://www.cs.put.poznan.pl/mdrozdowski/maintenance-scheduling/.Google Scholar
- (2000) Szeregowanie zadań w systemach z ograniczoną dostępnością procesorów. Ph.D. thesis, Poznań University of Technology, Poznań, Poland.Google Scholar
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco).Google Scholar
- (1999) Scheduling maintenance and semiresumable jobs on a single machine. Naval Res. Logist. 46(7):845–863.Crossref, Google Scholar
- (2006) Planning machine maintenance in two-machine shop scheduling. Oper. Res. 54(4):789–800.Link, Google Scholar
- (1976) Minimizing maximum lateness on one machine: Computational experience and some applications. Stat. Neerlandica 30(1):25–41.Crossref, Google Scholar
- (1996) Machine scheduling with an availability constraint. J. Global Optim. 9(3–4):395–416.Crossref, Google Scholar
- (2004) Machine scheduling with availability constraints. Leung JY-T, ed. Handbook of Scheduling (Chapman & Hall/CRC, Boca Raton, FL), 22.1–22.13.Google Scholar
- (2009) A note on single-machine group scheduling problems with position-based learning effect. Appl. Math. Model. 33(4):2159–2163.Crossref, Google Scholar
- (1977) Complexity of machine scheduling problems. Ann. Discrete Math. 1:343–362.Crossref, Google Scholar
- (2010) Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance. Appl. Math. Model. 34(2):334–342.Crossref, Google Scholar
- (2015) Minimizing the sum of absolute deviations under a common due date for a single-machine scheduling problem with availability constraints. J. Indust. Production Engrg. 32(3):204–217.Crossref, Google Scholar
- (2014) Ablaufplanung bei positionsfixen Wartungsmaßnahmen. Master’s thesis, University of Augsburg, Augsburg, Germany.Google Scholar
- (2012) Simple matching vs. linear assignment in scheduling models with positional effects: A critical review. Eur. J. Oper. Res. 222(3):393–407.Crossref, Google Scholar
- (2014) Combining time and position dependent effects on a single machine subject to rate-modifying activities. Omega 42(1):166–178.Crossref, Google Scholar
- (2013) Integrated aircraft routing, crew pairing, and tail assignment. PhD thesis, University of Newcastle, Callaghan, NSW, Australia.Google Scholar
- (2011) Minimizing total completion time on a single machine with a flexible maintenance activity. Comput. Oper. Res. 38(4):755–770.Crossref, Google Scholar
- (2004) Optimal preventive maintenance scheduling in semiconductor manufacturing. IEEE Trans. Semiconductor Manuf. 17(3):345–356.Crossref, Google Scholar
- (2005) Flow shop scheduling jobs with position-dependent processing times. J. Appl. Math. Comput. 18(1–2):383–391.Crossref, Google Scholar

