1. Sequencing and scheduling: Algorithms and complexity;Lawler,1993
2. Approximation algorithms for scheduling unrelated parallel machines;Lenstra;Mathematical Programming,1990
3. T. Ebenlendr, M. Krcal, J. Sgall, Graph balancing: A special case of scheduling unrelated parallel machines, in: Proceedings of the 19th ACM–SIAM Symposium on Discrete algorithms, SODA’2008, 2008, pp. 483–490
4. Polynomial time approximation algorithms for machine scheduling: Ten open problems;Schuurman;Journal of Scheduling,1999
5. Parallel machine scheduling under a grade of service provision;Hwang;Computers and Operations Research,2004