Partial Rescheduling Based on Branch and Bound for Single-Machine Problem

This paper addresses a single-machine large-scale rescheduling problems with efficiency and stability subject to machine breakdown. Partial rescheduling (PR) strategy is used to cope with the computational complexity. Two kinds of objective functions of PR sub-problem, where the global dual objectives are reflected to an extent, are designed respectively for the procedural PR horizon and the terminal PR horizon. The PR problem is solved by a branch and bound algorithm. Lower bound and upper bound procedures as well as dominance rules are developed for the branch and bound algorithm. An extensive experimentation was conducted. The computational results show that the branch and bound can solve PR sub-problems with certain scales and the partial rescheduling procedure developed can greatly improve the stability of schedule with little sacrifice in efficiency and provide a reasonable trade-off between solution quality and computational cost.