Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154)
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: Two branch-and-bound algorithms for the robust parallel machine scheduling problem |
scientific article; zbMATH DE number 6107595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two branch-and-bound algorithms for the robust parallel machine scheduling problem |
scientific article; zbMATH DE number 6107595 |
Statements
Two branch-and-bound algorithms for the robust parallel machine scheduling problem (English)
0 references
15 November 2012
0 references
robust scheduling
0 references
identical parallel machines
0 references
stochastic processing times
0 references
0 references
0 references
0 references
0 references
0 references
0.8314741253852844
0 references
0.8300301432609558
0 references
0.8259606957435608
0 references
0.8133079409599304
0 references
