Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the weighted sum of completion times. No polynomial 2-approximation algorithm for this problem has been previously known. We propose a 2-approximation algorithm with O(n^2) time complexity where n is the number of jobs. We show that this bound is tight. The obtained result outperforms all the previous polynomial approximation algorithms for this problem.

[1]  Xiangtong Qi,et al.  A note on worst-case performance of heuristics for maintenance scheduling problems , 2007, Discret. Appl. Math..

[2]  Xiangtong Qi,et al.  Scheduling the maintenance on a single machine , 1999, J. Oper. Res. Soc..

[3]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[4]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

[5]  Guoqing Wang,et al.  Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times , 2005, Ann. Oper. Res..

[6]  Joachim Breit,et al.  Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint , 2007, Eur. J. Oper. Res..

[7]  Gur Mosheiov,et al.  Minimizing the sum of job completion times on capacitated parallel machines , 1994 .

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

[9]  Chengbin Chu,et al.  Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times , 2008, Comput. Oper. Res..

[10]  Marie-Claude Portmann,et al.  Flow shop scheduling problem with limited machine availability: A heuristic approach , 2003 .

[11]  Scott Webster,et al.  Weighted flow time bounds for scheduling identical processors , 1995 .

[12]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

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

[14]  Alexander H. G. Rinnooy Kan,et al.  Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.

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

[16]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..

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

[18]  Jacek Blazewicz,et al.  An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints , 2005, Eur. J. Oper. Res..

[19]  Chengbin Chu,et al.  Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period , 2008, Eur. J. Oper. Res..

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

[21]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[22]  Yong He,et al.  Improved algorithms for two single machine scheduling problems , 2006, Theor. Comput. Sci..

[23]  Mohamed Haouari,et al.  Optimal parallel machines scheduling with availability constraints , 2005, Discret. Appl. Math..

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

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

[26]  W. J. Chen,et al.  Minimizing total flow time in the single-machine scheduling problem with periodic maintenance , 2006, J. Oper. Res. Soc..

[27]  I. Kacem,et al.  Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint , 2008 .

[28]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[29]  Abdelhakim Artiba,et al.  Scheduling of a two-machine flowshop with availability constraints on the first machine , 2006 .