Single-machine scheduling with simple linear deterioration to minimize earliness penalties



We consider a single-machine scheduling problem with deteriorating jobs in which the due dates are determined by the equal slack method. In this model, the processing time of a job is defined as a simple linear function of its starting 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.


Scheduling Single-machine Deteriorating jobs SLK due date 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50:711–720MATHCrossRefGoogle Scholar
  2. 2.
    Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Wang J-B, Xia Z-Q (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Wang J-B, Xia Z-Q (2006) Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34:327–336CrossRefMathSciNetGoogle Scholar
  5. 5.
    Wang J-B, Xia Z-Q (2006) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 57:220–226MATHGoogle Scholar
  6. 6.
    Gawiejnowicz S, Kurc W, Pankowska L (2006) Pareto and scalar bicriterion optimization in scheduling deteriorating jobs. Comput Oper Res 33:746–767MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Wang J-B, Ng CT, Cheng TCE, Liu LL (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Wang J-B (2007) Flow shop scheduling problems with decreasing linear deterioration under dominating machines. Comput Oper Res 34:2043–2058MATHCrossRefGoogle Scholar
  9. 9.
    Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180:472–478MATHCrossRefGoogle Scholar
  10. 10.
    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–2693MATHCrossRefGoogle Scholar
  11. 11.
    Leung JYT, Ng CT, Cheng TCE (2008) Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. Eur J Oper Res 187:1090–1099MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Wang J-B, Lin L, Shan F (2008) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol 39:808–812CrossRefGoogle Scholar
  13. 13.
    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–808CrossRefGoogle Scholar
  14. 14.
    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–1226CrossRefGoogle Scholar
  15. 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. 16.
    Cheng TCE, Kang LY, Ng CT (2004) Due-date assignment and single machine scheduling with deteriorating jobs. J Oper Res Soc 55:198–203MATHCrossRefGoogle Scholar
  17. 17.
    Cheng TCE, Kang LY, Ng CT (2005) Single machine due-date scheduling of jobs with decreasing start-time dependent processing times. Int Trans Oper Res 12:355–366MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Oron D (2008) Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Comput Oper Res 35:2071–2078MATHCrossRefGoogle Scholar
  19. 19.
    Chang S, Schneeberger H (1988) Single machine scheduling to minimize weighted earliness subject to no tardy jobs. Eur J Oper Res 34:221–230CrossRefGoogle Scholar
  20. 20.
    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–508MATHCrossRefGoogle Scholar
  21. 21.
    Gordon VS, Strusevich VA (1999) Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Comput Oper Res 26:157–177MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Pathumnakul S, Egbelu PJ (2005) Algorithm for minimizing weighted earliness penalty in single-machine problem. Eur J Oper Res 161:780–796MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653–659MATHCrossRefGoogle Scholar
  24. 24.
    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–326MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2009

Authors and Affiliations

  1. 1.Operations Research and Cybernetics Institute, School of ScienceShenyang Institute of Aeronautical EngineeringShenyangChina

Personalised recommendations