An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint

In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with pseudo-polynomial running time, and a fully polynomial-time approximation scheme (FPTAS).

[1]  Maciej Drozdowski,et al.  Scheduling Position-Dependent Maintenance Operations , 2017, Oper. Res..

[2]  Byung-Cheon Choi,et al.  Complexity of single machine scheduling subject to nonnegative inventory constraints , 2010, Eur. J. Oper. Res..

[3]  Jen-Shiang Chen.  Optimization models for the tool change scheduling problem , 2008 .

[4]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[5]  Jacek Blazewicz,et al.  Scheduling multiprocessor tasks on parallel processors with limited availability , 2003, Eur. J. Oper. Res..

[6]  Péter Györgyi,et al.  Approximation schemes for single machine scheduling with non-renewable resource constraints , 2014, J. Sched..

[7]  Erwin Pesch,et al.  Exact algorithms for inventory constrained scheduling on a single machine , 2013, J. Sched..

[8]  Antonio Costa,et al.  Minimizing the total completion time on a parallel machine system with tool changes , 2016, Comput. Ind. Eng..

[9]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[10]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[11]  Péter Györgyi,et al.  Reductions between scheduling problems with non-renewable resources and knapsack problems , 2015, Theor. Comput. Sci..

[12]  Ehab Morsy,et al.  Approximation algorithms for inventory constrained scheduling on a single machine , 2015, J. Sched..

[13]  Péter Györgyi,et al.  Approximability of scheduling problems with resource consuming jobs , 2015, Ann. Oper. Res..

[14]  Gerhard J. Woeginger,et al.  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..

[15]  Erwin Pesch,et al.  Variable very large neighbourhood algorithms for truck sequencing at transshipment terminals , 2013 .

[16]  Tamás Kis,et al.  Approximability of total weighted completion time with resource consuming jobs , 2015, Oper. Res. Lett..

[17]  Joseph Y.-T. Leung,et al.  Minimizing maximum lateness of jobs in inventory constrained scheduling , 2013, J. Oper. Res. Soc..

[18]  Min Ji,et al.  Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance , 2010 .

[19]  Bertrand M. T. Lin,et al.  Minimizing the total weighted completion time in the relocation problem , 2010, J. Sched..

[20]  Vitaly A. Strusevich,et al.  Simple matching vs linear assignment in scheduling models with positional effects: A critical review , 2012, Eur. J. Oper. Res..