Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic

References

• Adiri , I. , Bruno , J. , Frostig , E. and Rinnooy Kan , A. H.G. 1989 . Single machine flow-time scheduling with a single breakdown . Acta Inform. , 26 : 679 – 696 .
   Web of Science ®Google Scholar
• Aggoune , R. 2004 . Minimizing the makespan for the flow shop scheduling problem with availability constraints . Eur. J. Oper. Res. , 153 : 534 – 543 .
   Web of Science ®Google Scholar
• Aggoune , R. and Portmann , M-C. 2006 . Flow shop scheduling problem with limited machine availability: a heuristic approach . Int. J. Prod. Econ. , 99 : 4 – 15 .
   Web of Science ®Google Scholar
• Allaoui , A. and Artiba , A. 2006 . Scheduling two-stage hybrid flow shop with availability constraints . Comput. Oper. Res. , 33 : 1399 – 1419 .
   Web of Science ®Google Scholar
• Allaoui , A. , Artiba , A. , Elmaghraby , S. E. and Riane , F. 2006 . Scheduling of a two-machine flowshop with availability constraints on the first machine . Int. J. Prod. Econ. , 99 : 16 – 27 .
   Web of Science ®Google Scholar
• Belouadah , H. , Posner , M. E. and Potts , C. N. 1992 . Scheduling with release dates on a single machine to minimize total weighted completion time . Discr. Appl. Math. , 36 : 213 – 231 .
   Web of Science ®Google Scholar
• Chen , W. J. 2005 . Minimizing total flow time in the single-machine scheduling problem with periodic maintenance . J. Oper. Res. Soc. , 57 : 410 – 415 .
   Google Scholar
• Graves , G. H. and Lee , C-Y. 1999 . Scheduling maintenance and semiresumable jobs on a single machine . Nav. Res. Logist. , 46 : 845 – 863 .
   Web of Science ®Google Scholar
• Kacem , I. and Chu , C. 2006 . Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period . Eur. J. Oper. Res. , doi:10.1016/j.ejor.2006.06.062
   Google Scholar
• Kacem , I. and Chu , C. 2007 . Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint . Int. J. Prod. Econ. , doi:10.1016/j.cjpe.2007.01.013
   Google Scholar
• Kacem , I. , Chu , C. and Souissi , A. 2006 . Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times . Comput. Oper. Res. , doi:10.1016/j.cor.2006.04.010
   Google Scholar
• Kubzin , M. A. and Strusevich , V. A. 2006 . Planning machine maintenance in two machine shop scheduling . Oper. Res. , 54 : 789 – 800 .
   Web of Science ®Google Scholar
• Lee , C-Y. 1996 . Machine scheduling with an availability constraint . J. Glob. Optim. , 9 : 363 – 384 .
   Web of Science ®Google Scholar
• Lee , C-Y. 2004 . “ Machine scheduling with an availability constraint ” . In Handbook of Scheduling: Algorithms, Models, and Performance Analysis Edited by: Leung , J. Y.T. Boca Raton, FL chapter 22
   Google Scholar
• Lee , C-Y. and Chen , Z-L. 2000 . Scheduling of jobs and maintenance activities on parallel machines . Nav. Res. Logist. , 47 : 145 – 165 .
   Web of Science ®Google Scholar
• Lee , C-Y. and Liman , S. D. 1992 . Single machine flow-time scheduling with scheduled maitenance . Acta Inform. , 29 : 375 – 382 .
   Web of Science ®Google Scholar
• Lee , C-Y. and Liman , S. D. 1993 . Capacitated two-parallel machines sceduling to minimize sum of job completion times . Discr. Appl. Math. , 41 : 211 – 222 .
   Web of Science ®Google Scholar
• Mauguière , Ph. , Billaut , J-C. and Bouquard , J-L. 2005 . New single machine and job-shop scheduling problems with availability constraints . J. Schedul. , 8 : 211 – 231 .
   Web of Science ®Google Scholar
• Mosheiov , G. 1994 . Minimizing the sum of job completion times on capacitated parallel machines . Math. Comput. Model. , 20 : 91 – 99 .
   Web of Science ®Google Scholar
• Qi , X. , Chen , T. and Tu , F. 1999 . Scheduling the maintenance on a single machine . J. Oper. Res. Soc. , 50 : 1071 – 1078 .
   Web of Science ®Google Scholar
• Sadfi , C. , Penz , B. , Rapine , C. , Błażewicz , J. and Formanowicz , P. 2005 . An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints . Eur. J. Oper. Res. , 161 : 3 – 10 .
   Web of Science ®Google Scholar
• Sadfi , C. and Ouarda , Y. 2004 . Parallel machines scheduling problem with availability constraints . Ninth International Workshop on Project Management and Scheduling . 2004 .
   Google Scholar
• Sanlaville , E. and Schmidt , G. 1998 . Machine scheduling with availability constraints . Acta Inform. , 35 : 795 – 811 .
   Web of Science ®Google Scholar
• Schmidt , G. 2000 . Scheduling with limited machine availability . Eur. J. Oper. Res. , 121 : 1 – 15 .
   Web of Science ®Google Scholar
• Wang , G. , Sun , H. and Chu , C. 2005 . Preemptive scheduling with availability constraints to minimize total weighted completion times . Ann. Oper. Res. , 133 : 183 – 192 .
   Web of Science ®Google Scholar
• Webster , S. 1995 . Weighted flow time bounds for scheduling identical processors . Eur. J. Oper. Res. , 80 : 103 – 111 .
   Google Scholar