Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146)
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: Total completion time minimization on multiple machines subject to machine availability and makespan constraints |
scientific article; zbMATH DE number 6633437
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total completion time minimization on multiple machines subject to machine availability and makespan constraints |
scientific article; zbMATH DE number 6633437 |
Statements
Total completion time minimization on multiple machines subject to machine availability and makespan constraints (English)
0 references
6 October 2016
0 references
scheduling
0 references
parallel machine
0 references
bi-criteria
0 references
limited machine availability
0 references
polynomial time algorithm
0 references
0 references
0 references
