Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (Q3335507)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3867042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the sum of absolute lateness in single-machine and multimachine scheduling |
scientific article; zbMATH DE number 3867042 |
Statements
Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (English)
0 references
1984
0 references
sum of absolute lateness
0 references
common due date
0 references
identical parallel machines
0 references
heuristic method
0 references
computational results
0 references
0.911190629005432
0 references
0.8968479037284851
0 references
0.8614321351051331
0 references
0.8608563542366028
0 references
