Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains

2008 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
Performance properties of list scheduling algorithms under various dynamic assumptions are analyzed. The focus is on bounds for scheduling directed acyclic graphs with arbitrary precedence constrains and arbitrary task processing times subject to minimizing the makespan. New performance bounds are derived and compared with known results. key words: list scheduling, worst case analysis, on-line scheduling.
doi:10.1093/ietfec/e91-a.8.2277 fatcat:xyb3y6r32vgtnmlufqopjph4gm