Journal article
Scheduling processes with release times, deadlines, precedence and exclusion relations
Abstract
An algorithm that finds an optimal schedule on a single processor for a given set of processes is presented. Each process starts executing after its release time and completes its computation before its deadline and a given set of precedence relations and exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important and previously unsolved problem of automated pre-run-time …
Authors
Xu J; Parnas DL
Journal
IEEE Transactions on Software Engineering, Vol. 16, No. 3, pp. 360–369
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
3 1990
DOI
10.1109/32.48943
ISSN
0098-5589