A comparison of lower bounds for the single-machine early/tardy problem (Q868992)
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: A comparison of lower bounds for the single-machine early/tardy problem |
scientific article; zbMATH DE number 5129817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of lower bounds for the single-machine early/tardy problem |
scientific article; zbMATH DE number 5129817 |
Statements
A comparison of lower bounds for the single-machine early/tardy problem (English)
0 references
26 February 2007
0 references
scheduling
0 references
sequencing
0 references
branch-and-bound
0 references
heuristics
0 references
0 references
0.8669638633728027
0 references
0.8612558245658875
0 references
0.8485294580459595
0 references
0.8408098220825195
0 references
