An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773)
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: An iterative heuristic for the single machine dynamic total completion time scheduling problem |
scientific article; zbMATH DE number 909725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative heuristic for the single machine dynamic total completion time scheduling problem |
scientific article; zbMATH DE number 909725 |
Statements
An iterative heuristic for the single machine dynamic total completion time scheduling problem (English)
0 references
30 October 1996
0 references
total completion time
0 references
dynamic job arrivals
0 references
iterative improvement heuristic
0 references
0 references
0 references
0 references
0 references
