Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851)
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: Single machine scheduling to minimize mean absolute lateness: A heuristic solution |
scientific article; zbMATH DE number 4116295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine scheduling to minimize mean absolute lateness: A heuristic solution |
scientific article; zbMATH DE number 4116295 |
Statements
Single machine scheduling to minimize mean absolute lateness: A heuristic solution (English)
0 references
1990
0 references
heuristic solution
0 references
adjacent pairwise interchange
0 references
mean absolute lateness
0 references
single machine
0 references
0 references
0 references
