A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date

Abstract We address the single machine scheduling problem to minimize the total weighted earliness and tardiness about a nonrestrictive common due date. This is a basic problem with applications to the just-in-time manufacturing. The problem is linked to a Boolean programming problem with a quadratic objective function, known as the half-product. An approach to developing a fast fully polynomial-time approximation scheme (FPTAS) for the problem is identified and implemented. The running time matches the best known running time for an FPTAS for minimizing a half-product with no additive constant.

[1]  Arie Tamir,et al.  A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks , 1993, Math. Program..

[2]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[3]  Hans Kellerer,et al.  The symmetric quadratic knapsack problem: approximation and scheduling applications , 2012, 4OR.

[4]  Wieslaw Kubiak,et al.  New Results on the Completion Time Variance Minimization , 1995, Discret. Appl. Math..

[5]  Hans Kellerer,et al.  Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications , 2016, Ann. Oper. Res..

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

[7]  Zhou Xu,et al.  A strongly polynomial FPTAS for the symmetric quadratic knapsack problem , 2012, Eur. J. Oper. Res..

[8]  Wieslaw Kubiak,et al.  Algorithms for Minclique Scheduling Problems , 1997, Discret. Appl. Math..

[9]  Gur Mosheiov,et al.  Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..

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

[11]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[12]  Wieslaw Kubiak,et al.  Minimization of ordered, symmetric half-products , 2005, Discret. Appl. Math..

[13]  Vitaly A. Strusevich,et al.  Differential approximation schemes for half-product related functions and their scheduling applications , 2017, Discret. Appl. Math..

[14]  Yunqiang Yin,et al.  Just-in-time scheduling with two competing agents on unrelated parallel machines ☆ , 2016 .

[15]  Wieslaw Kubiak,et al.  Positive half-products and scheduling with controllable processing times , 2005, Eur. J. Oper. Res..

[16]  Hans Kellerer,et al.  Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product , 2013, Eur. J. Oper. Res..

[17]  Hans Kellerer,et al.  Approximability issues for unconstrained and constrained maximization of half-product related functions , 2017, Theor. Comput. Sci..

[18]  HANS KELLERER,et al.  Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack , 2010, Int. J. Found. Comput. Sci..

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