Author:
Zhu Jianqiao,Chan Ho-Leung,Lam Tak-Wah
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. Anderson, E.J., Jayram, T.S., Kimbrel, T.: Tighter bounds on preemptive job shop scheduling with two machines. Computing 67(1), 83–90 (2001)
2. Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Trans. Algorithms 3(4) (2007)
3. Bansal, N., Kimbrel, T., Sviridenko, M.: Job shop scheduling with unit processing times. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 207–214 (2005)
4. Brucker, P.: Job-shop scheduling problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1782–1788. Springer, Berlin (2009)
5. Chan, H.-L., Edmonds, J., Pruhs, K.: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. In: SPAA, pp. 1–10 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Flow time scheduling with uncertain processing time;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15