Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:51, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and approximation algorithms for makespan minimization on unrelated parallel machines |
scientific article |
Statements
Exact and approximation algorithms for makespan minimization on unrelated parallel machines (English)
0 references
10 August 1997
0 references
NP-hard problem
0 references
scheduling
0 references
