Fast approximation algorithms for job scheduling with processing set restrictions (Q410716): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:36, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation algorithms for job scheduling with processing set restrictions |
scientific article |
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
