Skip to main content
SpringerLink
Log in

A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties

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

Abstract

We consider a single-machine scheduling problem with deteriorating jobs in which the due dates are determined by the equal slack (SLK) method. By a deteriorating job, we mean that the job’s processing time is an increasing function of its starting time. We model job deterioration as a function that is proportional to a linear function of time. The objective is to minimize the total weighted earliness penalty subject to no tardy jobs. We prove that two special cases of the problem remain polynomially solvable. The first case is the problem with equally weighted monotonous penalty objective function and the other case is the problem with weighted linear penalty objective function.

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. Wang D, Wang J-B (2009) Single-machine scheduling with simple linear deterioration to minimize earliness penalties. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2086-8

    Google Scholar 

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

    Article  MATH  Google Scholar 

  3. 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 

  4. Wu C-C, Lee W-C, Shiau Y-R (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33:1237–1243

    Article  Google Scholar 

  5. Shiau Y-R, Lee W-C, Wu C-C, Chang C-M (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34:774–782

    Article  Google Scholar 

  6. Wang J-B, Lin L, Shan F (2008) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol 39:808–812

    Article  Google Scholar 

  7. Toksar MD, Guner 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 Technol 38:801–808

    Article  Google Scholar 

  8. Wang J-B, Gao W-J, Wang L-Y, Wang D (2009) Single machine group scheduling with general linear deterioration to minimize the makespan. Int J Adv Manuf Technol 43:146–150

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. 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 

  11. Wang J-B (2009) Single machine scheduling with a time-dependent learning effect and deteriorating jobs. J Oper Res Soc 60:583–586

    Article  Google Scholar 

  12. Wang J-B (2009) Single machine scheduling with decreasing linear deterioration under precedence constraints. Comput Math Appl 58:95–103

    Article  MathSciNet  Google Scholar 

  13. Wang J-B, Liu L-L (2009) Two-machine flow shop scheduling with linear decreasing job deterioration. Comput Ind Eng 56:1487–1493

    Article  Google Scholar 

  14. Wang J-B, Huang X, Wang X-Y, Yin N, Wang L-Y (2009) Learning effect and deteriorating jobs in the single machine scheduling problems. Appl Math Model 33:3848–3853

    Article  MathSciNet  Google Scholar 

  15. Wang J-B, Wang L-Y, Wang D, Wang X-Y (2008) Single machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1760-6

    Google Scholar 

  16. Wang J-B, Wang L-Y, Wang D, Huang X, Wang X-R (2008) A note on single-machine total completion time problem with general deteriorating function. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1918-2

    Google Scholar 

  17. Wu C-C, Shiau Y-R, Lee L-H, Lee W-C (2008) Scheduling deteriorating jobs to minimize the makespan on a single machine. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1924-4

    Google Scholar 

  18. Wang L-Y, Wang J-B, Wang D, Yin N, Huang X, Feng E-M (2009) Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs. Int J Adv Manuf Technol. doi:10.1007/s00170-009-1950-x

    Google Scholar 

  19. Gao W-J, Huang X, Wang J-B. Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2089-5

  20. Yin N, Wang J-B, Wang D, Wang L-Y, Wang X-Y (2009) Deteriorating jobs and Learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2116-6

    Google Scholar 

  21. Kononov A, Gawiejnowicz S (2001) NP-hard cases in scheduling deteriorating jobs on dedicated machines. J Oper Res Soc 52:708–717

    Article  MATH  Google Scholar 

  22. Zhao CL, Zhang QL, Tang HY (2003) Scheduling problems under linear deterioration. Acta Automatica Sinica 29:531–535

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  24. Qi X, Tu F-S (1998) Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method. Eur J Oper Res 105:502–508

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Operations Research and Cybernetics Institute, School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, 110136, China

    Xue Huang, Ji-Bo Wang & Xue-Ru Wang

Authors
  1. Xue Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xue-Ru Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xue Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X., Wang, JB. & Wang, XR. A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties. Int J Adv Manuf Technol 47, 1225–1230 (2010). https://doi.org/10.1007/s00170-009-2242-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2242-1

Keywords

Search

Navigation