Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143274 | Operations Research Letters | 2006 | 5 Pages |
Abstract
We consider the online scheduling of two machines under a grade of service (GoS) provision and its semi-online variant where the total processing time is known. Respectively for the online and semi-online problems, we develop algorithms with competitive ratios of 53 and 32 which are shown to be optimal.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jongho Park, Soo Y. Chang, Kangbok Lee,