Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139): Difference between revisions
From MaRDI portal
Latest revision as of 01:58, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan |
scientific article |
Statements
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (English)
0 references
29 June 2017
0 references
scheduling
0 references
single machine
0 references
equal processing times
0 references
polynomial algorithms
0 references
bi-criteria problem
0 references
0 references