Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine

We consider scheduling problems with learning/deterioration effects and time-dependent processing times on a single machine, with or without due date assignment considerations. By reducing them to a special assignment problem on product matrices, we solve all these problems in near-linear time. This improves the time complexity of previous algorithms for some scheduling problems and establishes the fast polynomial solvability for several other problems.

[1]  Vitaly A. Strusevich,et al.  Simple matching vs linear assignment in scheduling models with positional effects: A critical review , 2012, Eur. J. Oper. Res..

[2]  Gur Mosheiov,et al.  Note on scheduling with general learning curves to minimize the number of tardy jobs , 2005, J. Oper. Res. Soc..

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

[4]  S. S. Panwalkar,et al.  Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

[5]  T. C. Edwin Cheng,et al.  Due-date assignment and single machine scheduling with deteriorating jobs , 2004, J. Oper. Res. Soc..

[6]  Chengbin Chu,et al.  Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .

[7]  Surya D. Liman,et al.  Common due window size and location determination in a single machine scheduling problem , 1998, J. Oper. Res. Soc..

[8]  T. C. Edwin Cheng,et al.  Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan , 2007, Eur. J. Oper. Res..

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

[10]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[11]  Gur Mosheiov,et al.  Scheduling problems with a learning effect , 2001, Eur. J. Oper. Res..

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

[13]  Dvir Shabtay,et al.  A unified approach for scheduling with convex resource consumption functions using positional penalties , 2010, Eur. J. Oper. Res..

[14]  Matthew J. Sobel,et al.  Manufacturing lead-time rules: Customer retention versus tardiness costs , 2005, Eur. J. Oper. Res..

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

[16]  T. P. Wright,et al.  Factors affecting the cost of airplanes , 1936 .

[17]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[18]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[19]  Jean-Marie Proth,et al.  Scheduling with Due Date Assignment , 2004, Handbook of Scheduling.

[20]  Gur Mosheiov,et al.  A note on scheduling deteriorating jobs , 2005, Math. Comput. Model..

[21]  Dorit S. Hochbaum,et al.  Due Date Quotation Models and Algorithms , 2004, Handbook of Scheduling.

[22]  Gur Mosheiov,et al.  V-Shaped Policies for Scheduling Deteriorating Jobs , 1991, Oper. Res..

[23]  Costas P. Pappis,et al.  Scheduling fire-fighting tasks using the concept of deteriorating jobs , 2006 .

[24]  Chris N. Potts,et al.  Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation , 2008, J. Sched..

[25]  Dar-Li Yang,et al.  Single-machine scheduling with both deterioration and learning effects , 2009, Ann. Oper. Res..

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

[27]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[28]  Gur Mosheiov,et al.  Parallel machine scheduling with a learning effect , 2001, J. Oper. Res. Soc..

[29]  Vicente Salas-Fumás,et al.  Learning to learn and productivity growth: Evidence from a new car-assembly plant , 2013 .

[30]  G. Kent Webb,et al.  Integrated circuit (IC) pricing , 1994 .

[31]  Ji-Bo Wang,et al.  Two single-machine scheduling problems with the effects of deterioration and learning , 2010 .

[32]  Costas P. Pappis,et al.  Single Machine Scheduling with Flow Allowances , 1996 .

[33]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[34]  Christos Koulamas,et al.  A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times , 2010, Eur. J. Oper. Res..

[35]  Dirk Biskup,et al.  A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..

[36]  Adam Janiak,et al.  Scheduling Problems with Learning and Ageing Effects: A Survey , 2011 .

[37]  Uttarayan Bagchi,et al.  Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems , 1989, Oper. Res..

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

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

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

[41]  Anand S. Kunnathur,et al.  Optimal repayment policies for multiple loans , 1987 .

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

[43]  Wen-Chiung Lee,et al.  A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems , 2004 .