Abstract
In this paper, we consider an online non-preemptive scheduling problem on two related machines, with only one rearrangement at the end, called Online scheduling with one rearrangement at the end (OSORE). We proposed an improved algorithm for 1⩽s⩽2, where s is the speed ratio between the fast machine and slow machine. The upper bounds are 2(s+1)s+2 for 1⩽s⩽2 and s+2s+1 for 2<s⩽2, which are better than previous results, i.e. (s+1)2s+2 for 1⩽s⩽2 and s+1s for 2<s⩽2 (Liu et al., 2009 [7]).
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.
