Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint

ABSTRACT This study considers a single machine group scheduling problem with deteriorating jobs and resource allocation (controllable processing times). The objective is to have the resource availability limited within a given range, and to minimize the maximum completion time (i.e. the makespan). For two special cases, it is proved that the problem can be solved in polynomial time. For the general case, an heuristic algorithm and a branch-and-bound algorithm are proposed. Computational results show that the proposed heuristic algorithm is generally effective.

[1]  Danyu Bai,et al.  Open shop scheduling problem to minimize total weighted completion time , 2017 .

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

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

[4]  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..

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

[6]  Fardin Ahmadizar,et al.  Outsourcing and scheduling for a two-machine flow shop with release times , 2018 .

[7]  Ada Che,et al.  Bi-objective scheduling on uniform parallel machines considering electricity cost , 2018 .

[8]  Dan Wang,et al.  Single-machine group scheduling with deteriorating jobs and allotted resource , 2014, Optim. Lett..

[9]  Danyu Bai,et al.  Permutation flow-shop scheduling problem to optimize a quadratic objective function , 2017 .

[10]  Ji-Bo Wang,et al.  A note on resource allocation scheduling with group technology and learning effects on a single machine , 2017 .

[11]  Jian-Jun Wang,et al.  Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times , 2013 .

[12]  Lu Liu,et al.  Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost , 2016 .

[13]  Xue-Ru Wang,et al.  Single-machine scheduling with convex resource dependent processing times and deteriorating jobs , 2013 .

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

[15]  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 .

[16]  Jian-Jun Wang,et al.  Single-machine bicriterion group scheduling with deteriorating setup times and job processing times , 2014, Appl. Math. Comput..

[17]  张蕾.  带有退化维修和交货期窗口的加工时间分别可控的单机排序问题 Single-Machine Due-Window Assignment and Scheduling with Discretely Controllable Job Processing Times and a Deteriorating Rate-Modifying Activity , 2017 .

[18]  Chin-Chia Wu,et al.  Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop , 2017 .

[19]  Chung-Lun Li,et al.  Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption , 1994 .

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

[21]  Yuan-Yuan Lu,et al.  A note on resource allocation scheduling with position-dependent workloads , 2017 .

[22]  Jian-Jun Wang,et al.  Single-machine scheduling problems with precedence constraints and simple linear deterioration , 2015 .

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

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

[25]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[26]  Chin-Chia Wu,et al.  Scheduling with non-decreasing deterioration jobs and variable maintenance activities on a single machine , 2017 .

[27]  Ji-Bo Wang,et al.  Group scheduling with independent setup times, ready times, and deteriorating job processing times , 2011, The International Journal of Advanced Manufacturing Technology.

[28]  Zuren Feng,et al.  Single machine scheduling with total tardiness criterion and convex controllable processing times , 2011, Ann. Oper. Res..

[29]  Yu Zhang,et al.  Single-machine ready times scheduling with group technology and proportional linear deterioration , 2014 .