1. Abolhassani, M., Chan, T. H., Chen, F., Esfandiari, H., Hajiaghayi, M., Hamid, M., et al. (2016). Beating ratio 0.5 for weighted oblivious matching problems. In P. Sankowski & C. Zaroliagis (Eds.), 24th Annual European symposium on algorithms (ESA 2016) (Vol. 57, pp. 3:1–3:18).
2. Alon, N., Azar, Y., Woeginger, G. J., & Yadid, Y. (1998). Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1, 55–66.
3. Blocher, J. D., & Sevastyanov, D. (2015). A note on the coffman-sethi bound for LPT scheduling. Journal of Scheduling, 18, 325–327.
4. Chen, B. (1993). A note on LPT scheduling. Operation Research Letters, 14, 139–142.
5. Chen, B., Potts, C. N., & Woeginger, G. J. (1999). A review of machine scheduling: Complexity, algorithms and approximability. In D. Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization: Volume 1–3. New York: Springer.