Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel machine makespan minimization subject to machine availability and total completion time constraints |
scientific article |
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
