Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663619 | European Journal of Operational Research | 2005 | 14 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Simon Dunstall, Andrew Wirth,