A Single-Machine deteriorating Job Scheduling Problem with a Non-Regular Criterion

In scheduling environments with deterioration, a job processed later consumes more time than that same job when processed earlier. The deteriorating job scheduling problems have been widely studied in the last two decades. However, no result of the completion time variance has been reported. In this study, we consider the variance of job completion time minimization problem on a single machine. It is assumed that the job processing time is a simple linear function of its starting time. We show that an optimal schedule is V-shaped with respect to the job deteriorating rates. A heuristic algorithm utilized the V-shaped property is then proposed, and a computational experiment shows that the proposed heuristic algorithm is quite accurate.

[1]  Wen-Chiung Lee,et al.  Minimizing the total weighted completion time on a single machine under linear deterioration , 2007 .

[2]  T. C. Edwin Cheng,et al.  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..

[3]  Ji-Bo Wang,et al.  Single-machine scheduling problems with the effects of learning and deterioration , 2007 .

[4]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[5]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[6]  T.C.E. Cheng,et al.  Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint , 2008, Comput. Oper. Res..

[7]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

[8]  Wieslaw Kubiak,et al.  Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..

[9]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[10]  T. C. Edwin Cheng,et al.  Scheduling Problems with the Effects of deterioration and Learning , 2007, Asia Pac. J. Oper. Res..

[11]  T. C. Edwin Cheng,et al.  Scheduling jobs with piecewise linear decreasing processing times , 2003 .

[12]  P. S. Sundararaghavan,et al.  Single machine scheduling with start time dependent processing times: Some solvable cases , 1994 .

[13]  J.-B. Wang,et al.  A note on scheduling problems with learning effect and deteriorating jobs , 2006, Int. J. Syst. Sci..

[14]  Li-Yan Wang,et al.  Single machine group scheduling under decreasing linear deterioration , 2007 .

[15]  C. T. Ng,et al.  Minimizing Completion Time Variance with Compressible Processing Times , 2005, J. Glob. Optim..

[16]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[17]  C. T. Ng,et al.  A New Model For Completion Time Variance Problem With Job-Dependent Weights And Controllable Processing Times , 1997 .

[18]  T. C. Edwin Cheng,et al.  Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine , 2003, Comput. Oper. Res..

[19]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[20]  G. Srinivasan,et al.  A branch and bound algorithm to minimize completion time variance on a single processor , 2003, Comput. Oper. Res..

[21]  T.C.E. Cheng,et al.  Scheduling start time dependent jobs to minimize the total weighted completion time , 2002, J. Oper. Res. Soc..

[22]  Xiaoqiang Cai,et al.  A tight lower bound for the completion time variance problem , 1996 .

[23]  L. Schrage.  Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

[24]  Jinjiang Yuan,et al.  Single Machine Scheduling with Job Delivery to minimize makespan , 2008, Asia Pac. J. Oper. Res..

[25]  Xiaoqiang Cai,et al.  Minimization of agreeably weighted variance in single machine systems , 1995 .

[26]  T. C. Edwin Cheng,et al.  Minimizing total completion time in a two-machine flow shop with deteriorating jobs , 2006, Appl. Math. Comput..

[27]  Zhi-Long Chen,et al.  A note on single-processor scheduling with time-dependent execution times , 1995, Oper. Res. Lett..

[28]  Chia-Ming Chang,et al.  Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration , 2007 .

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

[30]  Wieslaw Kubiak,et al.  Proof of a conjecture of Schrage about the completion time variance problem , 1991, Oper. Res. Lett..

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

[32]  Ji-Bo Wang,et al.  Scheduling jobs under decreasing linear deterioration , 2005, Inf. Process. Lett..

[33]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[34]  T. C. Edwin Cheng,et al.  Single machine scheduling with step-deteriorating processing times , 2001, Eur. J. Oper. Res..

[35]  Ji-Bo Wang,et al.  Flow shop scheduling with deteriorating jobs under dominating machines , 2006 .

[36]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

[37]  Xiaoqiang Cai,et al.  Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem , 1999 .

[38]  T. C. Edwin Cheng,et al.  Three scheduling problems with deteriorating jobs to minimize the total completion time , 2002, Inf. Process. Lett..