A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889)
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 branch and bound procedure to minimize mean absolute lateness on a single processor |
scientific article; zbMATH DE number 960892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound procedure to minimize mean absolute lateness on a single processor |
scientific article; zbMATH DE number 960892 |
Statements
A branch and bound procedure to minimize mean absolute lateness on a single processor (English)
0 references
5 October 1997
0 references
mean absolute lateness single machine scheduling
0 references
branch and bound
0 references
dominance
0 references
decomposition
0 references
0 references
0 references
0 references
0 references
0.8524576425552368
0 references
0.8356826901435852
0 references
0.8209739923477173
0 references
0.8099802136421204
0 references
0.8085132837295532
0 references
