Article ID: | iaor20082439 |
Country: | United Kingdom |
Volume: | 10 |
Issue: | 3 |
Start Page Number: | 223 |
End Page Number: | 235 |
Publication Date: | Jun 2007 |
Journal: | Journal of Scheduling |
Authors: | Herroelen Willy, Leus Roel |
Keywords: | programming: branch and bound |
Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that changes only little when variations in the input parameters arise. This paper presents a model for single-machine scheduling with stability objective and a common deadline. We propose a branch-and-bound algorithm for solving an approximate formulation of the model. The algorithm is exact when exactly one job is disrupted during schedule execution.