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 the normal view instead:
scientific article; zbMATH DE number 6633437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9731168150901794
0 references
0.9387244582176208
0 references
0.930962085723877
0 references
0.8730581998825073
0 references
0.8381208777427673
0 references
