Journal
OPERATIONS RESEARCH LETTERS
Volume 34, Issue 6, Pages 692-696Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2005.11.004
Keywords
Online; semi-online; two machines; grade of service
Categories
Ask authors/readers for more resources
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 5/3 and 3/2 which are shown to be optimal. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
