By Topic

Asymptotic performance ratio of an online algorithm for the single machine scheduling with release dates

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chou, C.-F.M. ; Dept. of Decision Sci., Nat. Univ. of Singapore, Singapore

We analyze the single machine weighted completion time problem with release dates and prove that the asymptotic performance ratio of a simple online algorithm is one. This implies that this algorithm generates a solution whose relative error decreases to zero as the number of jobs increases. Our proof does not require any probabilistic assumption on the job parameters and relies heavily on properties of optimal solutions to a linear programming relaxation of the problem.

Published in:

Automatic Control, IEEE Transactions on  (Volume:49 ,  Issue: 5 )