On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311)
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 5758806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems |
scientific article; zbMATH DE number 5758806 |
Statements
On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (English)
0 references
21 July 2010
0 references
scheduling
0 references
combinatorial optimization
0 references
time-indexing
0 references
0 references
0 references
0 references
0 references
0.8044838905334473
0 references
0.7932804822921753
0 references
0.7828385233879089
0 references
