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 this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
