Scheduling jobs with deterioration effect and controllable processing time

This article considered the single machine scheduling with controllable processing time (resource allocation) and deterioration effect concurrently. It discussed the minimization of three objectives, which involve the weighted sum of the makespan and the total resource consumption cost, the total resource consumption cost under the condition that the makespan (total flow time) is restricted to a fixed constant and the optimal resource allocation and the optimal job sequence is what we need to make decision. Considering the makespan constraint, it proved that these problems can be solved in polynomial time. A special case of the last problem can be solved in polynomial time with respect to the total flow time constraint.

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

[2]  Gang Li,et al.  Optimal due-date assignment problem with learning effect and resource-dependent processing times , 2014, Optim. Lett..

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

[4]  Dvir Shabtay,et al.  Convex resource allocation for minimizing the makespan in a single machine with job release dates , 2004, Comput. Oper. Res..

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

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

[7]  T. C. Edwin Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due date and controllable processing times , 2013, Comput. Ind. Eng..

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

[9]  Daniel Oron,et al.  Scheduling controllable processing time jobs in a deteriorating environment , 2014, J. Oper. Res. Soc..

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

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

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

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

[14]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

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

[16]  Ji-Bo Wang,et al.  Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time , 2012, Comput. Oper. Res..