Abstract
The paper deals with the single-machine scheduling problems with a time-dependent deterioration. By time-dependent deterioration, we mean that the processing time of a job is defined by an increasing function of total normal processing time of jobs in front of it in the sequence. We show that, even with the introduction of time-dependent deterioration to job processing times, the single-machine makespan minimization problem remains polynomially solvable. We also show that an optimal schedule of the total completion time minimization problem is V-shaped with respect to normal job processing times.
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
Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13
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
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.
Wang J-B, Lin L, Shan F (2007) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol. doi:10.1007/s00170-007-1255-x
Wang J-B, Jiang Y, Wang G (2008) Single machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1512-7
Wang J-B, Gao W-J, Wang L-Y, Wang D (2008) Single machine group scheduling with general linear deterioration to minimize the makespan. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1667-2
Toksar MD, Guner E (2007) 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. doi:10.1007/s00170-007-1128-3
Kuo W-H, Yang D-L (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Oper Res 174:1184–1190
Wang J-B, Ng CT, Cheng TCE, Liu L-L (2008) Single machine scheduling with a time-dependent learning effect. Int J Prod Econ 111:802–811
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, JB., Wang, LY., Wang, D. et al. Single-machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol 43, 805–809 (2009). https://doi.org/10.1007/s00170-008-1760-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-008-1760-6