Name
Title | ||
|---|---|---|
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines |
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.ejor.2004.03.022 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Branch and bound,Parallel machines,Setup times | Branch and bound,Mathematical optimization,Job shop scheduling,Workload,Scheduling (computing),Algorithm,Branch and bound method,Mathematics,Branching (version control),Computation,Search tree | Journal |
Volume | Issue | ISSN |
167 | 2 | 0377-2217 |
Citations | PageRank | References |
9 | 0.70 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon Dunstall | 1 | 49 | 5.34 |
| A. Wirth | 2 | 164 | 15.46 |