A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines |
scientific article |
Statements
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (English)
0 references
4 August 2005
0 references
Scheduling
0 references
Branch and bound
0 references
Parallel machines
0 references
Setup times
0 references
0 references
0 references
0 references
0 references
0 references
