Question
3.50
- Can you find an order-requirement digraph with four tasks for which every priority list used to schedule the tasks on two machines assigns task T4 to machine 1 at time 0?
- Can you choose the order-requirement digraph in part (a) so that machine 2 stays idle for all lists from time 0 to time 3?