Minimizing total weighted completion time with uncertain data: a stability approach (Q612208)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5831174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total weighted completion time with uncertain data: a stability approach |
scientific article; zbMATH DE number 5831174 |
Statements
Minimizing total weighted completion time with uncertain data: a stability approach (English)
0 references
3 January 2011
0 references
uncertain data
0 references
single-machine scheduling problem
0 references
optimal permutation for each possible realization
0 references
branch-and-bound algorithm
0 references
stability box
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9314458966255188
0 references
0.8889035582542419
0 references
0.8523534536361694
0 references
0.8197863698005676
0 references
