Fast approximation algorithms for job scheduling with processing set restrictions (Q410716)
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: Fast approximation algorithms for job scheduling with processing set restrictions |
scientific article; zbMATH DE number 6021253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation algorithms for job scheduling with processing set restrictions |
scientific article; zbMATH DE number 6021253 |
Statements
Fast approximation algorithms for job scheduling with processing set restrictions (English)
0 references
3 April 2012
0 references
tree-hierarchical processing set
0 references
inclusive processing set
0 references
nested processing set
0 references
makespan minimization
0 references
polynomial-time approximation algorithm
0 references
NP-hard
0 references
nonpreemptive scheduling
0 references
0 references
