Abstract
This paper considers the single machine scheduling problem with a new version of time-dependent processing times. The processing time of a job is defined as a piecewise linear function of its start time. It is preferred that the processing of each job be started at a specific time which means that processing the job before or after that time implies additional effort to accomplish the job. The job-processing time is a nonmonotonic function of its start time. The increasing rate of processing times is job independent and the objective is to minimize the cycle time. We show that the optimal schedule is V shaped and propose an optimal polynomial time algorithm for the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Mosheiov G (1996) Λ-shaped polices to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191
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
Chung Y-H, Liu H-C, Wu C-C, Lee W-C (2009) A deteriorating jobs problem with quadratic function of job lateness. Comput Ind Eng 57:1182–1186
CaiX WuX, Zhou X (2011) Scheduling deteriorating jobs on a single machine subject to breakdowns. J Sched 14:173–186
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
Li Y, Li G, Sun L, Xu Z (2009) Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times. Int J Prod Econ 118:424–429
Wang J-B (2009) Single machine scheduling with decreasing linear deterioration under precedence constraints. Comput Math Appl 58:95–103
Huang X, Wang J-B, Wang X-R (2010) A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties. Int J Adv Manuf Technol 47:1225–1230
Ng CT, Li S, Cheng TCE, Yuan J (2010) Preemptive scheduling with simple linear deterioration on a single machine. Theor Comput Sci 411:3578–3586
Zhu VCY, Sun L, Sun L, Li X (2010) Single-machine scheduling time-dependent jobs with resource-dependent ready times. Comput Ind Eng 58:84–87
Layegh J, Jolai F, Sadegh Amalnik M (2009) Amemetic algorithm for minimizing the total weighted completion time on asingle machine under step-deterioration. Adv Eng Softw 40:1074–1077
Wu C-C, Shiau Y-R, Lee L-H, Lee W-C (2009) Scheduling deteriorating jobs to minimize the makespan on a single machine. Int J Adv Manuf Technol 44:1230–1236
Yang Y, Da-Zhi W, Ding-Wei W, Ip WH, Hong-Feng W (2009) Single machine group scheduling problems with the effects of deterioration and learning. Acta Autom Sin 35(10):1290–1295
Lai P-J, Lee W-C (2010) Single-machine scheduling with a nonlinear deterioration function. Inf Process Lett 110:455–459
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hosseinabadi Farahani, M., Hosseini, L. Minimizing cycle time in single machine scheduling with start time-dependent processing times. Int J Adv Manuf Technol 64, 1479–1486 (2013). https://doi.org/10.1007/s00170-012-4116-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-4116-1