Corpus ID: 209531941

New Competitive Analysis Results of Online List Scheduling Algorithm

@article{Mohanty2020NewCA,
  title={New Competitive Analysis Results of Online List Scheduling Algorithm},
  author={Rakesh Mohanty and Debasis Dwibedy and Shreeya Swagatika Sahoo},
  journal={ArXiv},
  year={2020},
  volume={abs/2001.00004}
}
  • Rakesh Mohanty, Debasis Dwibedy, Shreeya Swagatika Sahoo
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • Online algorithm has been an emerging area of interest for researchers in various domains of computer science. The online $m$-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… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    Bounds for Certain Multiprocessor Timing Anomalies

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    G.J.(1993) ”An online scheduling heuristic with better worst case ratio than Graham’s list scheduling

    • G Galambos, Woeginger
    • SIAM Journal of Computing,
    • 1993
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Online scheduling: Introduction to Scheduling”, edited by Y

    • S Albers
    • Robert and F. Vivien
    • 2009
    VIEW 1 EXCERPT

    The Power of Reordering for Online Minimum Makespan Scheduling

    Online scheduling”. Handbook on scheduling: Algorithms, models and performance

    • K. Pruhs, J. Sgall, E.2004 Torng
    • 2004

    Improved Bounds for the Online Scheduling Problem

    VIEW 1 EXCERPT

    J.F.(2001) ”Improved bounds for the online scheduling problem”, Ph.D Thesis

    • III Rudin
    • 2001