Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact and approximation algorithms for makespan minimization on unrelated parallel machines |
scientific article; zbMATH DE number 1047040
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and approximation algorithms for makespan minimization on unrelated parallel machines |
scientific article; zbMATH DE number 1047040 |
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
