Minimizing cycle time in single machine scheduling with start time-dependent processing times

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.

[1]  Xian Zhou,et al.  Scheduling deteriorating jobs on a single machine subject to breakdowns , 2011, J. Sched..

[2]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[3]  Ji-Bo Wang,et al.  Single machine scheduling with decreasing linear deterioration under precedence constraints , 2009, Comput. Math. Appl..

[4]  Wen-Chiung Lee,et al.  Single-machine scheduling with a nonlinear deterioration function , 2010, Inf. Process. Lett..

[5]  Xiaohong Li,et al.  Single-machine scheduling time-dependent jobs with resource-dependent ready times , 2010, Comput. Ind. Eng..

[6]  Ji-Bo Wang,et al.  A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties , 2010 .

[7]  T. C. Edwin Cheng,et al.  Preemptive scheduling with simple linear deterioration on a single machine , 2010, Theor. Comput. Sci..

[8]  Gur Mosheiov,et al.  Λ-Shaped Policies to Schedule Deteriorating Jobs , 1996 .

[9]  Wen-Chiung Lee,et al.  Scheduling deteriorating jobs to minimize the makespan on a single machine , 2009 .

[10]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[11]  Fariborz Jolai,et al.  A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration , 2009, Adv. Eng. Softw..

[12]  Dazhi Wang,et al.  Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning , 2009 .

[13]  Hongfeng Wang,et al.  Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning: Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning , 2009 .

[14]  Li-Yan Wang,et al.  Single machine group scheduling with general linear deterioration to minimize the makespan , 2009 .

[15]  Yu-Hsiang Chung,et al.  A deteriorating jobs problem with quadratic function of job lateness , 2009, Comput. Ind. Eng..

[16]  Linyan Sun,et al.  Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times , 2009 .