Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem

We study the n–job two–parallel machines scheduling problem with the aim of minimising the total flow–time. In this problem, instead of allowing both machines to be continuously available as it is often assumed in the literature, we consider that one of the machines is available for a specified period of time after which it can no longer process any job. On the basis of the modification of an exact algorithm execution, we establish the existence of a strongly Fully Polynomial Time Approximation Scheme (FPTAS) for the above–mentioned problem.

[1]  Wieslaw Kubiak,et al.  Fully Polynomial Approximation Schemes for Decomposable Partition Problems , 2000 .

[2]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[3]  Hans Kellerer,et al.  Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates , 2011, J. Sched..

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

[5]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[6]  Chien-Hung Lin,et al.  Minimizing the sum of job completion times on capacitated two-parallel machines , 2009, Eur. J. Oper. Res..

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

[8]  Imed Kacem.  Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date , 2010, Discret. Appl. Math..

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

[10]  Ali Ridha Mahjoub,et al.  Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval , 2009, Comput. Ind. Eng..

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

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

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

[14]  Chung-Yee Lee,et al.  Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

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

[16]  Mohamed Haouari,et al.  Approximation algorithms for single machine scheduling with one unavailability period , 2009, 4OR.