A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

Chekuri, C., & Khanna, S. (2001). A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. In F. Orejas, P. G. Spirakis, & J. van Leeuwen (Eds.), Proceedings of International Colloquium on Automata Languages and Programming, ICALP’01 (Vol. 2076). Berlin, Heidelberg: Springer Berlin Heidelberg. Retrieved from http://link.springer.com/10.1007/3-540-48224-5