Abstract
We show that unit execution time jobs subject to a precedence constraint whose complement is chordal can be scheduled in linear time on m processors. Generalizations to arbitrary execution times are NP-complete.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have