volume 6, issue 1, P7-35 1994
DOI: 10.1007/bf01245297
View full text
|
|
Share

Abstract: Consider the problem of scheduling a set of n tasks on a uniprocessor such that a feasible schedule that satisfies each task's time constraints is generated. Traditionally, researchers have looked at all the tasks as a group and applied heuristic or enumeration search to it. We propose a new approach called the decomposition scheduling where tasks are decomposed into a sequence of subsets. The subsets are scheduled independently, in the order of the sequence. It is proved that a feasible schedule can be gener…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
0
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals