Skip to main content
SpringerLink
Log in

A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The time-dependent scheduling problems have received considerable attention recently. However, machine availability, an important and practical consideration, is usually neglected. Motivated by this observation, we introduce a single-machine scheduling problem where deteriorating jobs and an availability constraint are considered. Our objective is to minimize the total completion time. In this paper, we derived optimal and near-optimal solutions for the problem, and we also gave a simulation study to show that our algorithm successfully yields the optimal solution for instances with less than 20 jobs in less than a minute. Our computational experiment also showed that the mean error percentage of the proposed heuristic algorithm for all test instances is less than 1.3% and drops to zero as the number of jobs increases.

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

  1. Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. Journal of the Operational Research Society 50:711–720

    Article  MATH  Google Scholar 

  2. Bachman A, Cheng TCE, Janiak A, Ng CT (2002) Scheduling start time dependent jobs to minimize the total weighted completion time. Journal of the Operational Research Society 53(6):688–693

    Article  MATH  MathSciNet  Google Scholar 

  3. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Operations Research 38:495–498

    Article  MATH  Google Scholar 

  4. Cheng TCE, Ding Q (1998) The complexity of single machine scheduling with release times. Information Processing Letters 65(2):75–79

    Article  MathSciNet  Google Scholar 

  5. Cheng TCE, Ding Q (2001) Single machine scheduling with step-deteriorating processing times. Eur J Oper Res 134:623–630

    Article  MATH  MathSciNet  Google Scholar 

  6. Cheng TCE, Ding Q (2003) Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine. Computers and Operations Research 30(1):51–62

    Article  MATH  MathSciNet  Google Scholar 

  7. Cheng TCE, Ding Q, Kovalyov MY, Bachman A, Janiak A (2003) Scheduling jobs with piecewise linear decreasing processing times. Naval Research Logistics 50(6):531–554

    Article  MATH  MathSciNet  Google Scholar 

  8. 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  MATH  MathSciNet  Google Scholar 

  9. Graves GH, Lee CY (1999) Scheduling maintenance and semi-resumable jobs on a single machine. Naval Research Logistics 46:845–863

    Article  MATH  MathSciNet  Google Scholar 

  10. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering 14:387–393

    Article  Google Scholar 

  11. Hsieh YC, Bricker DL (1997) Scheduling linearly deteriorating jobs on multiple machines. Computers and Industrial Engineering 32:727–734

    Article  Google Scholar 

  12. Lee CY (1996) Machine scheduling with an availability constraint. J Glob Optim 9:395–419

    Article  MATH  Google Scholar 

  13. Lee WC, Wu CC, Liu HC (2009) A note on single-machine makespan problem with general deteriorating function. Int J Adv Manuf Tech 40:1053–1056

    Article  Google Scholar 

  14. Liu L, Gu HY, Xi YG (2007) Robust and stable scheduling of a single machine with random machine breakdowns. Int J Adv Manuf Tech 31:645–654

    Article  Google Scholar 

  15. Ng CTD, Cheng TCE, Bachman A (2002) Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters 81(6):327–333

    Article  MathSciNet  Google Scholar 

  16. Shiau YR, Lee WC, Wu CC, Chang CM (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Tech 33:1237–1243

    Article  Google Scholar 

  17. Sundararaghavan PS, Kunnathur A (1994) Single machine scheduling with start time dependent processing time: some solvable cases. Eur J Oper Res 78(3):394–403

    Article  MATH  Google Scholar 

  18. Toksari MD, Güner E (2008) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Tech 38:801–808

    Article  Google Scholar 

  19. Wang JB, Ng CTD, Cheng TCE, Liu LL (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193

    Article  MATH  MathSciNet  Google Scholar 

  20. Wang JB (2006) A note on scheduling problems with learning effect and deteriorating jobs. International Journal of Systems Science 37(12):827–833

    Article  MATH  MathSciNet  Google Scholar 

  21. Wang JB (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35(4):397–402

    Article  Google Scholar 

  22. Wang JB, Cheng TCE (2007) Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research 24(2):245–261

    Article  MathSciNet  Google Scholar 

  23. Wang JB, Ng CTD, Cheng TCE (2008) Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Computers and Operations Research 35(8):2684–2693

    MATH  Google Scholar 

  24. Wang JB, Xia ZQ (2006) Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34:327–336

    Article  MathSciNet  Google Scholar 

  25. Wang JB (2009) Single machine scheduling with a time-dependent learning effect and deteriorating jobs. Journal of Operational Research Society 60:583–586

    Article  Google Scholar 

  26. Wang JB, Lin L, Shan F (2008) Single machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Tech 39:808–812

    Article  Google Scholar 

  27. Wang JB, Jiang Y, Wang G (2009) Single machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int J Adv Manuf Tech 41:1221–1226

    Article  Google Scholar 

  28. Wang JB, Gao WJ, Wang LY, Wang D (2009) Single machine group scheduling with general linear deterioration to minimize the makespan. Int J Adv Manuf Tech 43:146–150

    Article  Google Scholar 

  29. Wang JB, Wang LY, Wang D, Huang X, Wang XR (2009) A note on single-machine total completion time problem with general deteriorating function. Int J Adv Manuf Tech . doi:10.1007/s00170-008-1918-2

    Google Scholar 

  30. Wu CC, Lee WC (2003) Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Information Processing Letters 87:89–93

    Article  MATH  MathSciNet  Google Scholar 

  31. Wu CC, Lee WC, Shiau YR (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Tech 33:1237–1243

    Article  Google Scholar 

  32. Wu CC, Shiau YR, Lee LH, Lee WC (2009) Scheduling deteriorating jobs to minimize the makespan on a single machine. Int J Adv Manuf Tech. doi:10.1007/s00170-008-1924-4

    Google Scholar 

  33. Zhao CL, Tang HY (2005) Single machine scheduling problems with deteriorating jobs. Appl Math Comput 161:865–874

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, 100 Wenhwa Road, Taichung, Taiwan

    Wen-Chiung Lee, Yu Shin Lin & Chin-Chia Wu

Authors
  1. Wen-Chiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Shin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chin-Chia Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, WC., Lin, Y.S. & Wu, CC. A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem. Int J Adv Manuf Technol 47, 1217–1223 (2010). https://doi.org/10.1007/s00170-009-2232-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2232-3

Keywords

Search

Navigation