| Article ID: | iaor20062610 |
| Country: | Netherlands |
| Volume: | 167 |
| Issue: | 2 |
| Start Page Number: | 283 |
| End Page Number: | 296 |
| Publication Date: | Dec 2005 |
| Journal: | European Journal of Operational Research |
| Authors: | Wirth Andrew, Dunstall Simon |
| Keywords: | programming: branch and bound |
This paper investigates branch-and-bound algorithms for the problem of scheduling jobs with family setups on identical parallel machines to minimize the weighted sum of completion times. In particular, we propose a new branching scheme that appears to substantially outperform current procedures in terms of computation time and search tree size.