Ordering of Time-Dependent Tasks for Self-Organized Resource Scheduling


We present a framework to order time-dependent tasks with respect to self-organized resource scheduling. The focus is to check if a given task set is executable at all, and in this case we present algorithms to compute a ordering for its tasks. 
DOI: 10.1109/ISORCW.2011.26


7 Figures and Tables

Slides referencing similar topics