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 5 3 and 3 2 which are shown to be optimal.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have