Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602)
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: Scheduling UET-UCT tasks: Branch-and-bound search in the priority space |
scientific article; zbMATH DE number 5844650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling UET-UCT tasks: Branch-and-bound search in the priority space |
scientific article; zbMATH DE number 5844650 |
Statements
Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (English)
0 references
3 February 2011
0 references
scheduling
0 references
parallel processors
0 references
partially ordered tasks
0 references
unit communication delay
0 references
maximum lateness
0 references
release times
0 references
