Browsing Combinatorics and Optimization by Subject "Makespan"
Now showing items 1-1 of 1
-
Techniques for Proving Approximation Ratios in Scheduling
(University of Waterloo, 2010-09-30)The problem of finding a schedule with the lowest makespan in the class of all flowtime-optimal schedules for parallel identical machines is an NP-hard problem. Several approximation algorithms have been suggested for ...