A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines |
scientific article; zbMATH DE number 2191870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines |
scientific article; zbMATH DE number 2191870 |
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
0.8919284343719482
0 references
0.8431845307350159
0 references
0.8395857810974121
0 references
0.8273303508758545
0 references
