Skip to main content
SpringerLink
Log in

Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity. We assume that after maintenance activity, the machine will revert to its initial condition and the aging effects will start anew. Moreover, due to the restriction of budget of maintenance, the limitation of the maintenance frequency on the machine is assumed to be known in advance. The optional maintenance activity of this study means that the starting time of the maintenance activity is unknown in advance. It can be scheduled immediately after the processing of any job that has been completed. Therefore, the planner must to make decision on whether or when to schedule the maintenance activity during the scheduling horizon to optimal the performance measures. The objective is to minimize the makespan. We first show that the addressed problem is NP-hard in the strong sense. Then a fully polynomial-time approximation scheme (FPTAS) for the proposed problem is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–720

    MATH  Google Scholar 

  • Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178

    Article  MATH  Google Scholar 

  • Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329

    Article  MathSciNet  MATH  Google Scholar 

  • Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498

    Article  MATH  Google Scholar 

  • Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13

    Article  MathSciNet  MATH  Google Scholar 

  • Cheng TCE, Wu C-C, Lee W-C (2008) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 54:972–982

    Article  Google Scholar 

  • Cheng TCE, Hsu C-J, Huang Y-C, Lee W-C (2010) Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Comput Oper Res 38:1760–1765. doi:10.1016/j.cor.2010.11.014

    Article  MathSciNet  Google Scholar 

  • Fan B-Q, Li S-S, Zhao L, Zhang L-Q (2011) Scheduling resumable deteriorating jobs on a single machine with non-availability constraints. Theor Comput Sci 412:275–280

    Article  MATH  Google Scholar 

  • Gawiejnowicz S (1996) A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf Process Lett 57:297–300

    Article  MathSciNet  MATH  Google Scholar 

  • Gawiejnowicz S, Kononov A (2010) Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur J Oper Res 200:305–308

    Article  MATH  Google Scholar 

  • Gawiejnowicz S, Kurc W, Pankowska L (2009) Equivalent time-dependent scheduling problems. Eur J Oper Res 196:919–929

    Article  MathSciNet  MATH  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

  • Huang X, Wang M-Z, Wang J-B (2010) Single-machine group scheduling with both learning effects and deteriorating jobs. Comput Ind Eng 60:750–754

    Article  Google Scholar 

  • Janiak A, Rudek R (2009) Experience-based approach to scheduling problems with the learning effect. IEEE Trans Syst Man Cybern, Part A 39:344–357

    Article  Google Scholar 

  • Janiak A, Rudek R (2010) Scheduling jobs under an aging effect. J Oper Res Soc 61:1041–1048

    Article  MATH  Google Scholar 

  • Ji M, Cheng TCE (2007) An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. Inf Process Lett 102:41–47

    Article  MathSciNet  MATH  Google Scholar 

  • Ji M, Cheng TCE (2008a) Parallel-machine scheduling with simple linear deterioration to minimize total completion time. Eur J Oper Res 188:342–347

    Article  MathSciNet  MATH  Google Scholar 

  • Ji M, Cheng TCE (2008b) An FPTAS for parallel-machine scheduling with a grade of service provision to minimize makespan. Inf Process Lett 108:171–174

    Article  MathSciNet  Google Scholar 

  • Ji M, Cheng TCE (2009) Parallel-machine scheduling of simple linear deteriorating jobs. Theor Comput Sci 410:3761–3768

    Article  MathSciNet  MATH  Google Scholar 

  • Ji M, Cheng TCE (2010a) Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan. Eur J Oper Res 202:90–98

    Article  MathSciNet  MATH  Google Scholar 

  • Ji M, Cheng TCE (2010b) Scheduling with job-dependent learning effects and multiple rate-modifying activities. Inf Process Lett 110:460–463

    Article  MathSciNet  MATH  Google Scholar 

  • Kovalyov MY, Kubiak W (1998) A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J Heuristics 3:287–297

    Article  MATH  Google Scholar 

  • Kovalyov MY, Kubiak W (1999) A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Oper Res 47:757–761

    Article  MathSciNet  MATH  Google Scholar 

  • Kunnathur AS, Gupta SK (1990) Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Oper Res 47:56–64

    Article  MathSciNet  MATH  Google Scholar 

  • Kuo W-H, Yang D-L (2011) A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects. J Oper Res Soc 62:206–210

    Article  Google Scholar 

  • Lai P-J, Lee W-C (2010) Single-machine scheduling with a nonlinear deterioration function. Inf Process Lett 110:455–459

    Article  MathSciNet  MATH  Google Scholar 

  • Li S, Ng CT, Cheng TCE, Yuan J (2011) Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur J Oper Res 210:482–488

    Article  MathSciNet  MATH  Google Scholar 

  • Lee W-C, Wu C-C, Chung Y-H (2008) Scheduling deteriorating jobs on a single machine with release times. Comput Ind Eng 54:441–452

    Article  Google Scholar 

  • Lee W-C, Wu C-C, Liu H-C (2009) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Technol 40:1053–1056

    Article  Google Scholar 

  • Lee W-C, Wang W-J, Shiau Y-R, Wu C-C (2010) A single-machine scheduling problem with two-agent and deteriorating jobs. Appl Math Model 34:3098–3107

    Article  MathSciNet  MATH  Google Scholar 

  • Low C, Hsu CJ, Su CT (2008) Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Comput Math Appl 56:257–265

    Article  MathSciNet  MATH  Google Scholar 

  • Mosheiov G (1994) Scheduling deteriorating jobs under simple linear deterioration. Comput Oper Res 21:653–659

    Article  MATH  Google Scholar 

  • Mosheiov G (1995) Scheduling jobs with step-deterioration: minimizing makespan on single and multi-machine. Comput Ind Eng 28:869–879

    Article  Google Scholar 

  • Ng CT, Barketau MS, Cheng TCE, Kovalyov MY (2010) “Product Partition” and related problems of scheduling and systems reliability: computational complexity and approximation. Eur J Oper Res 207:601–604

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Wang C (2011) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35:4017–4022

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Ng CT, Cheng TCE (2008) Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Comput Oper Res 35:2684–2693

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Wang J-J, Ji P (2010) Scheduling jobs with chain precedence constraints and deteriorating jobs. J Oper Res Soc. doi:10.1057/jors.2010.120

    Google Scholar 

  • Wu C-C, Lee W-C (2008) Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int J Prod Econ 115:128–133

    Article  Google Scholar 

  • Wu C-C, Shiau Y-R, Lee W-C (2008) Single-machine group scheduling problems with deterioration consideration. Comput Oper Res 35:1652–1659

    Article  MATH  Google Scholar 

  • Yang S-J, Yang D-L (2010) Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities. Comput Math Appl 60:2161–2169

    Article  MathSciNet  MATH  Google Scholar 

  • Zhao C-L, Tang H-Y (2011) A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints. Optim Lett 5:183–190

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou, 310018, P.R. China

    Min Ji

  2. Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou, 542, Taiwan, ROC

    Chou-Jung Hsu

  3. Department of Information Management, National Formosa University, Yun-Lin, 632, Taiwan, ROC

    Dar-Li Yang

Authors
  1. Min Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chou-Jung Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dar-Li Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dar-Li Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ji, M., Hsu, CJ. & Yang, DL. Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration. J Comb Optim 26, 437–447 (2013). https://doi.org/10.1007/s10878-011-9415-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-011-9415-1

Keywords

Search

Navigation