Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

In this article, we consider a single-machine scheduling problem with one unavailability period, with the aim of minimizing the weighted sum of the completion times. We propose three exact methods for solving such a problem: a branch-and-bound method based on new properties and lower bounds, a mixed integer programming model, and a dynamic programming method. These methods were coded and tested on randomly generated instances, and their performances were analyzed. Our numerical experiments show that the branch-and-bound method and the dynamic programming method are complementary. Using these approaches, we are able to solve problems with up to 3000 jobs within a reasonable computation time.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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