Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115)
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 7177717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel machine makespan minimization subject to machine availability and total completion time constraints |
scientific article; zbMATH DE number 7177717 |
Statements
Parallel machine makespan minimization subject to machine availability and total completion time constraints (English)
0 references
6 March 2020
0 references
bi-criteria scheduling
0 references
parallel machines
0 references
limited machine availability
0 references
total completion time
0 references
makespan
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.930962085723877
0 references
0.9201327562332152
0 references
0.8917781710624695
0 references
0.8826216459274292
0 references
