Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

m unrelated parallel machines scheduling problems with variable job processing times are considered, where 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 determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost. If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem.

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

[2]  Xue Huang,et al.  Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties , 2011 .

[3]  J.-B. Wang,et al.  Worst-case analysis for flow shop scheduling problems with an exponential learning effect , 2012, J. Oper. Res. Soc..

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

[5]  Na Yin,et al.  Single-machine group scheduling with processing times dependent on position, starting time and allotted resource , 2014 .

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

[7]  Na Yin,et al.  Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times , 2014 .

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

[9]  Cheng Wang,et al.  Single-machine due-window assignment problem with learning effect and deteriorating jobs , 2011 .

[10]  Ji-Bo Wang,et al.  Scheduling jobs with truncated exponential learning functions , 2013, Optim. Lett..

[11]  T.C.E. Cheng,et al.  Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions , 2014 .

[12]  Ping Ji,et al.  Single-machine scheduling with time-and-resource-dependent processing times , 2012 .

[13]  Chou-Jung Hsu,et al.  Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time , 2012, Optimization Letters.

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

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

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

[17]  T. C. Edwin Cheng,et al.  Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time , 2014, J. Oper. Res. Soc..

[18]  T.C.E. Cheng,et al.  Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times , 2013 .

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

[20]  Ming-Zheng Wang,et al.  Single machine scheduling with a general exponential learning effect , 2012 .

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

[22]  Na Yin,et al.  Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs , 2015 .

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

[24]  Zhizhong Mao,et al.  Single-Machine Scheduling with Job Rejection, Deteriorating Effects, and Deteriorating Maintenance Activities , 2013 .

[25]  Gur Mosheiov,et al.  Scheduling with general job-dependent learning curves , 2003, Eur. J. Oper. Res..

[26]  Ji-Bo Wang,et al.  Scheduling Jobs with Processing times Dependent on Position, Starting Time, and Allotted Resource , 2012, Asia Pac. J. Oper. Res..

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

[28]  T. C. Edwin Cheng,et al.  Some scheduling problems with deteriorating jobs and learning effects , 2008, Comput. Ind. Eng..

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

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

[31]  Ji-Bo Wang,et al.  Flowshop scheduling with a general exponential learning effect , 2014, Comput. Oper. Res..

[32]  Xue Huang,et al.  Single-machine group scheduling with general deterioration and learning effects , 2012 .

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

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

[35]  Chuanli Zhao,et al.  Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times , 2014 .

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

[37]  T. C. Edwin Cheng,et al.  Unrelated parallel-machine scheduling with deteriorating maintenance activities , 2011, Comput. Ind. Eng..