New Competitive Analysis Results of Online List Scheduling Algorithm
Rakesh Mohanty, Debasis Dwibedy, Shreeya Swagatika Sahoo

TL;DR
This paper presents new upper bounds on the competitive ratio of Graham's online list scheduling algorithm for independent jobs, improving understanding of its performance in specific input scenarios.
Contribution
It introduces two novel upper bounds on the competitive ratio of LSA for particular classes of input sequences, advancing theoretical analysis.
Findings
Upper bound of 2 - 2/m on competitive ratio
Upper bound of 2 - (m^2 - m + 1)/m^2 on competitive ratio
Results motivate designing improved online scheduling algorithms
Abstract
Online algorithm has been an emerging area of interest for researchers in various domains of computer science. The online -machine list scheduling problem introduced by Graham has gained theoretical as well as practical significance in the development of competitive analysis as a performance measure for online algorithms. In this paper, we study and explore the performance of Graham's online \textit{list scheduling algorithm(LSA)} for independent jobs. In the literature, \textit{LSA} has already been proved to be competitive, where is the number of machines. We present two new upper bound results on competitive analysis of \textit{LSA}. We obtain upper bounds on the competitive ratio of and respectively for practically significant two special classes of input job sequences. Our analytical results can motivate the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Scheduling and Optimization Algorithms · Complexity and Algorithms in Graphs
