UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Techniques for Proving Approximation Ratios in Scheduling

Thumbnail Image

Files

Ravi_Peruvemba.pdf (461.94 KB)

Date

2010-09-30T18:21:49Z

Authors

Ravi, Peruvemba Sundaram

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

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 this problem. We focus on algorithms that are fast and easy to implement, rather than on more involved algorithms that might provide tighter approximation bounds. A set of approaches for proving conjectured bounds on performance ratios for such algorithms is outlined. These approaches are used to examine Coffman and Sethi's conjecture for a worst-case bound on the ratio of the makespan of the schedule generated by the LD algorithm to the makespan of the optimal schedule. A significant reduction is achieved in the size of a hypothesised minimal counterexample to this conjecture.

Description

Keywords

Approximation Ratios, Scheduling, Makespan, Flowtime-optimal Schedules, Coffman-Sethi Conjecture, LD Algorithm

LC Keywords

Citation

URI

http://hdl.handle.net/10012/5552

Collections

Theses
Combinatorics and Optimization