On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OR-Library / rank | |||
Normal rank | |||
Revision as of 05:32, 28 February 2024
scientific article
| 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 |
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
