Scheduling with resource allocation and past-sequence-dependent setup times including maintenance

In this work, scheduling problems with resource allocation and past-sequence-dependent (p-s-d) setup times are considered. Under these settings, the actual job processing times are dependent on the amount of resource allocated and the setup times are proportionate to the length of the already processed jobs. The objective function is a combination of the total completion time and the total resource consumption. In addition, the machine may need maintenance to improve its production efficiency, so the maintenance is also integrated. The optimal job sequence, the optimal amount of resource allocated to each job, and the optimal maintenance position are determined jointly. It is shown that the problem under study is polynomial time solvable.

[1]  Ji-Bo Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect , 2008, Comput. Ind. Eng..

[2]  Daniel Oron,et al.  Due-date assignment and maintenance activity scheduling problem , 2006, Math. Comput. Model..

[3]  Farouk Yalaoui,et al.  An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times , 2003 .

[4]  Christos Koulamas,et al.  A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times , 2010, Eur. J. Oper. Res..

[5]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

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

[7]  Dvir Shabtay,et al.  A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates , 2006, Comput. Oper. Res..

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

[9]  T.C.E. Cheng,et al.  Scheduling problems with deteriorating jobs and learning effects including proportional setup times , 2010, Comput. Ind. Eng..

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

[11]  C.-Y. Lee,et al.  Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[12]  T.C.E. Cheng,et al.  Single machine scheduling with a restricted rate‐modifying activity , 2005 .

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

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

[15]  Rakesh K. Sarin,et al.  Technical Note - Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy , 1989, Oper. Res..

[16]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[17]  Jan Karel Lenstra,et al.  Perspectives on parallel computing , 1989 .

[18]  Dar-Li Yang,et al.  Single machine scheduling with past-sequence-dependent setup times and learning effects , 2007, Inf. Process. Lett..

[19]  Gur Mosheiov,et al.  Scheduling a maintenance activity and due-window assignment on a single machine , 2009, Comput. 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]  Dirk Biskup,et al.  Single-machine scheduling against due dates with past-sequence-dependent setup times , 2008, Eur. J. Oper. Res..

[22]  Christos Koulamas,et al.  Single-machine scheduling problems with past-sequence-dependent setup times , 2008, Eur. J. Oper. Res..