Journal of Scheduling

, Volume 15, Issue 5, pp 565–578 | Cite as

Scheduling flexible maintenance activities subject to job-dependent machine deterioration

  • Stefan BockEmail author
  • Dirk Briskorn
  • Andrei Horbach


This paper considers single machine scheduling that integrates machine deterioration. The current maintenance state of the machine is determined by a maintenance level which drops by a certain, possibly job-dependent, amount while jobs are processed. A maintenance level of less than zero is associated with the machine’s breakdown and is therefore forbidden. Consequently, maintenance activities that raise the maintenance level again may become necessary and have to be scheduled additionally. In what follows, two general types of maintenance activities are distinguished. In the full maintenance case, maintenance activities are always executed until the machine has reached the maximum maintenance level. In contrast to this, the schedule in the partial maintenance case has to additionally determine the duration of maintenance activities. By combining both cases with regular objective functions such as minimization of maximum tardiness, minimization of the sum of completion times, or minimization of the number of tardy jobs, we obtain a new set of specific single-stage scheduling problems. Besides motivating and introducing these problems, we shall also analyze the computational complexity of general and specific cases.


Machine scheduling Maintenance Machine deterioration 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Brucker, P. (2004). Scheduling algorithms. Berlin: Springer. Google Scholar
  2. Chen, J.-S. (2008). Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research, 190, 90–102. CrossRefGoogle Scholar
  3. Cheng, T., Ding, Q., & Lin, B. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1–13. CrossRefGoogle Scholar
  4. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimisation and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 236–287. CrossRefGoogle Scholar
  5. Janiak, A., & Rudek, R. (2010). Scheduling jobs under an aging effect. Journal of the Operational Research Society, 61, 1041–1048. CrossRefGoogle Scholar
  6. Lee, C.-Y. (2004). Machine scheduling with availability constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 22-1–22-13). Google Scholar
  7. Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102–109. CrossRefGoogle Scholar
  8. Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity and due-window assignment on a single machine. Computers & Operations Research, 36, 2541–2545. CrossRefGoogle Scholar
  9. Pinedo, M. (2009). Springer series in operations research and financial engineering. Planning and scheduling in manufacturing and services (2nd ed.). Berlin: Springer. CrossRefGoogle Scholar
  10. Sun, K., & Li, H. (2010). Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines. International Journal of Production Economics, 124, 151–158. CrossRefGoogle Scholar
  11. Xu, D., Yin, Y., & Li, H. (2010). Scheduling jobs under increasing linear machine maintenance time. Journal of Scheduling, 13, 443–449. CrossRefGoogle Scholar
  12. Yang, S.-J., & Yang, D.-L. (2010). Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega, 38, 528–533. CrossRefGoogle Scholar
  13. Zhao, C.-L., & Tang, H.-Y. (2010). Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Applied Mathematical Modelling, 34, 837–841. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Business Computing and Operations Research, Schumpeter School of Business and EconomicsUniversity of WuppertalWuppertalGermany
  2. 2.Lehrstuhl für BWL (Quantitative Planung)University of SiegenSiegenGermany
  3. 3.“Friedrich List” Faculty of Transportation and Traffic SciencesDresden University of TechnologyDresdenGermany

Personalised recommendations