Analysis of scheduling problems with typed task systems (Q1331888)
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: Analysis of scheduling problems with typed task systems |
scientific article; zbMATH DE number 626246
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of scheduling problems with typed task systems |
scientific article; zbMATH DE number 626246 |
Statements
Analysis of scheduling problems with typed task systems (English)
0 references
27 September 1994
0 references
This paper deals with the analysis of a scheduling problem where each task has a type and where only a bounded number of processes of each type is available. It is shown that the typed scheduling problem remains NP- complete for a disjoint set of chains, two types and one processor of each type. If the deadline is a constant number, this problem, given \(k\) processors, remains NP-complete for out-trees, in-trees and disjoint union of chains.
0 references
typed task systems
0 references
NP-complete
0 references
