Abstract

We consider in this work a classical online scheduling problem with release times on a single machine. The quality of service of a job is measured by its stretch, which is defined as the ratio of its response time over its processing time. Our objective is to schedule the jobs non-preemptively in order to optimize the maximum stretch. We present both positive and negative theoretical results. First, we provide an online algorithm based on a waiting strategy which is \((1+\frac{\sqrt{5}-1}{2}\varDelta )\)-competitive where \(\varDelta \) is the upper bound on the ratio of processing times of any two jobs. Then, we show that no online algorithm has a competitive ratio better than \(\frac{\sqrt{5}-1}{2}\varDelta \). The proposed algorithm is asymptotically the best algorithm for optimizing the maximum stretch on a single machine.

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 call

Disclaimer: 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.