Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint

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

[2]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

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

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

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

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

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

[8]  Eric Sanlaville,et al.  Machine scheduling with availability constraints , 1998, Acta Informatica.

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

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

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

[12]  Chérif Sadfi,et al.  A dynamic programming algorithm for the single machine total completion time scheduling problem with availability constraints , 2001 .

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

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

[15]  Horst A. Eiselt,et al.  Single Machine Scheduling , 2004 .

[16]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

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

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

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

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

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

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

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

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

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

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

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