1. Sequencing tasks with exponential service times to minimize the expected flow time or makespan;Bruno;J. ACM,1981
2. M. Cheung, F. Fischer, J. Matuschke, N. Megow, An Ω(Δ1∕2) Gap example on the (W)SEPT Policy, Unpublished note, 2014.
3. Theory of Scheduling;Conway,1967
4. Bounds for the optimal scheduling of n jobs on m processors;Eastman;Manage. Sci.,1964
5. Bandit processes and dynamic allocation indices;Gittins;J. R. Stat. Soc. Ser. B Stat. Methodol.,1979