Abstract
In this paper we consider the problem of semi-online scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. Assume that the speed of the fast processor is s , while the speed of the slow one is normalized to 1. As a function of s , we derive general lower bounds on the competitive ratio achievable with respect to offline optimum, and design on-line algorithms with guaranteed upper bound on their competitive ratio. The algorithms presented for s ≥ 3 are optimal, as well as for s = 1 and for 1 + 17 4 ≤ s ≤ 1 + 3 2 .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
