Scheduling Jobs with Processing times Dependent on Position, Starting Time, and Allotted Resource

We consider single-machine scheduling problem in which the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times, and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times, and total resource cost. The problem is modeled as an assignment problem, and thus can be solved in polynomial time. Some extensions of the problem are also shown.

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

[2]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs , 1998, J. Heuristics.

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

[4]  Adam Janiak,et al.  Minimizing the total weighted completion time of deteriorating jobs , 2002, Inf. Process. Lett..

[5]  Eugeniusz Nowicki,et al.  A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..

[6]  Yu-Hsiang Chung,et al.  Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates , 2009, Comput. Oper. Res..

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

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

[9]  Dan Wang,et al.  Single-machine scheduling with learning effect and resource-dependent processing times , 2010, Comput. Ind. Eng..

[10]  Dvir Shabtay,et al.  Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine , 2007, Manuf. Serv. Oper. Manag..

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

[12]  Wen-Chiung Lee,et al.  Single-machine and flowshop scheduling with a general learning effect model , 2009, Comput. Ind. Eng..

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

[14]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[15]  T. C. Edwin Cheng,et al.  Bicriterion Single Machine Scheduling with Resource Dependent Processing Times , 1998, SIAM J. Optim..

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

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

[18]  Suh-Jenq Yang,et al.  Single-machine group scheduling problems under the effects of deterioration and learning , 2010, Comput. Ind. Eng..

[19]  Adam Janiak,et al.  Batching work and rework processes with limited deterioration of reworkables , 2006, Comput. Oper. Res..

[20]  Adam Janiak,et al.  Job Sequencing with Exponential Functions of Processing Times , 2006, Informatica.

[21]  Adam Janiak,et al.  Single machine scheduling subject to deadlines and resource dependent processing times , 1996 .

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

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

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

[25]  Chin-Chia Wu,et al.  Minimizing the makespan on a single machine with learning and unequal release times , 2010, Comput. Ind. Eng..

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

[27]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

[28]  Dvir Shabtay,et al.  The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times , 2008, Ann. Oper. Res..

[29]  Zhang Xingong,et al.  Single-machine group scheduling problems with deteriorated and learning effect , 2010, Appl. Math. Comput..

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

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

[32]  T.C.E. Cheng,et al.  Resource optimal control in some single-machine scheduling problems , 1994, IEEE Trans. Autom. Control..

[33]  A. Janiak,et al.  Scheduling Deteriorating Jobs Dependent on Resources for the Makespan Minimization , 2001 .

[34]  Ji-Bo Wang,et al.  Learning effect and deteriorating jobs in the single machine scheduling problems , 2009 .

[35]  Stanisław Gawiejnowicz,et al.  Basics of time-dependent scheduling , 2008 .

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

[37]  A. Janiak.  Single machine sequencing with linear models of release dates , 1998 .

[38]  Dar-Li Yang,et al.  Some scheduling problems with deteriorating jobs and learning effects , 2010, Comput. Ind. Eng..

[39]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[40]  Yu-Hsiang Chung,et al.  A two-machine flowshop makespan scheduling problem with deteriorating jobs , 2008, Comput. Ind. Eng..

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

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

[43]  T. C. Edwin Cheng,et al.  A permutation flow-shop scheduling problem with convex models of operation processing times , 2000, Ann. Oper. Res..

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

[45]  Adam Janiak,et al.  Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..

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