Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

This paper deals with the total weighted tardiness minimization with a common due date on a single machine. The best previous approximation algorithm for this problem was recently presented in [H. Kellerer, V.A. Strusevich, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, Theoretical Computer Science 369 (2006) 230-238] by Kellerer and Strusevich. They proposed a fully polynomial time approximation scheme (FPTAS) of O((n^6logW)/@e^3) time complexity (W is the sum of weights, n is the number of jobs and @e is the error bound). For this problem, we propose a new approach to obtain a more effective FPTAS of O(n^2/@e) time complexity. Moreover, a more effective and simpler dynamic programming algorithm is designed.

[1]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[2]  Chris N. Potts,et al.  Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..

[3]  Hans Kellerer,et al.  A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date , 2006, Theor. Comput. Sci..

[4]  Kirk Pruhs,et al.  Approximation schemes for a class of subset selection problems , 2007, Theor. Comput. Sci..

[5]  Imed Kacem.  Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval , 2009, J. Comb. Optim..

[6]  Sartaj Sahni,et al.  General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[7]  Endre Boros,et al.  Minimization of Half-Products , 1998, Math. Oper. Res..

[8]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem , 1999, Oper. Res..

[9]  Gerhard J. Woeginger,et al.  A comment on scheduling two parallel machines with capacity constraints , 2005, Discret. Optim..

[10]  Hans Kellerer,et al.  Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications , 2010, Algorithmica.

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

[12]  Y. Fathi,et al.  Heuristics for the common due date weighted tardiness problem , 1990 .

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

[14]  Jay B. Ghosh,et al.  FPTAS for half-products minimization with scheduling applications , 2008, Discret. Appl. Math..

[15]  Eugene Levner,et al.  Fast approximation algorithm for job sequencing with deadlines , 1981, Discret. Appl. Math..