Round robin scheduling - a survey

By Rasmus V. Rasmussen, Michael A. Trick. European Journal of Operational Research, 2008

373 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Management Science and Operations Research, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/8a0279d3fbe846110b0b4cc82bc43ae9af6dd2e2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Sheng Wen
2. Seyit Ahmet Camtepe
3. Xiaogang Zhu
4. Yang Xiang

In Management Science and Operations Research

1. Sheng Wen
2. Seyit Ahmet Camtepe
3. Xiaogang Zhu
4. Yang Xiang

In Numerical Analysis

1. Sheng Wen
2. Seyit Ahmet Camtepe
3. Xiaogang Zhu
4. Yang Xiang

Citations in the corpus

• Fuzzing: A Survey for Roadmap (2022, methodology): “For path transitions, a naive solution to obtain all transition probabilities is the Round-Robin schedule [156], which splits the time budget between seeds equally [158].”