Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan

We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine. Each job's processing time is an increasing simple linear function of its starting time. The machine can process up to b jobs simultaneously as a batch. The objective is to minimize the maximum completion time, i.e., makespan. For the unbounded model, i.e., b = [infinity], we obtain an O(n log n) dynamic programming algorithm. For the bounded model, i.e., b

[1]  Alexander V. Kononov,et al.  Complexity and approximability of scheduling resumable proportionally deteriorating jobs , 2010, Eur. J. Oper. Res..

[2]  Chung Keung Poon,et al.  Minimizing Makespan in Batch Machine Scheduling , 2000, Algorithmica.

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

[4]  Zhaohui Liu,et al.  Scheduling one batch processor subject to job release dates , 2000, Discret. Appl. Math..

[5]  Yuzhong Zhang,et al.  Approximation Algorithms in Batch Processing , 1999, ISAAC.

[6]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[7]  Wen-Chiung Lee,et al.  Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine , 2003, Inf. Process. Lett..

[8]  T. C. Edwin Cheng,et al.  Parallel-machine scheduling of simple linear deteriorating jobs , 2009, Theor. Comput. Sci..

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

[10]  O. I. Mel'nikov,et al.  Parametric problem in scheduling theory , 1979 .

[11]  Mateusz Gorczyca,et al.  Resource level minimization in the discrete-continuous scheduling , 2010, Eur. J. Oper. Res..

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

[13]  Gur Mosheiov,et al.  Multi-Machine Scheduling With Linear Deterioration , 1998 .

[14]  Jose A. Ventura,et al.  Single machine earliness-tardiness scheduling with resource-dependent release dates , 2002, Eur. J. Oper. Res..

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

[16]  T. C. Edwin Cheng,et al.  Parallel-machine scheduling with simple linear deterioration to minimize total completion time , 2008, Eur. J. Oper. Res..

[17]  Shuguang Li,et al.  Minimizing makespan with release times on identical parallel batching machines , 2005, Discret. Appl. Math..

[18]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[19]  Adam Janiak,et al.  Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..

[20]  Christopher D. Geiger,et al.  A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration , 2010, Eur. J. Oper. Res..

[21]  Zhi-Long Chen.  Parallel Machine Scheduling with Time Dependent Processing Times , 1996, Discret. Appl. Math..

[22]  Yuzhong Zhang,et al.  Approximation Algorithms in Batch Processing , 1999, ISAAC.

[23]  T. C. Edwin Cheng,et al.  "Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation , 2010, Eur. J. Oper. Res..

[24]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[25]  Zhi-Long Chen,et al.  Parallel Machine Scheduling with Time Dependent Processing Times , 1997, Discrete Applied Mathematics.

[26]  T. C. Edwin Cheng,et al.  Scheduling linear deteriorating jobs with an availability constraint on a single machine , 2006, Theor. Comput. Sci..

[27]  Jinjiang Yuan,et al.  Single machine parallel-batch scheduling with deteriorating jobs , 2009, Theor. Comput. Sci..

[28]  Shijie Sun,et al.  Scheduling linear deteriorating jobs with rejection on a single machine , 2009, Eur. J. Oper. Res..

[29]  Stanislaw Gawiejnowicz,et al.  Scheduling deteriorating jobs subject to job or machine availability constraints , 2007, Eur. J. Oper. Res..

[30]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[31]  Stanislaw Gawiejnowicz,et al.  Equivalent time-dependent scheduling problems , 2009, Eur. J. Oper. Res..

[32]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[33]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[34]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[35]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .