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
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10107-006-0013-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2137215422 / rank | |||
Normal rank |
Revision as of 22:17, 19 March 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