Author:
Garg Naveen,Kumar Amit,Pandit Vinayaka
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Abramson, D., Sosic, R., Giddy, J., Hall, B.: Nimrod: A tool for performing parameterised simulations using distributed applications. In: Proceedings of the 4th IEEE Symposium on High Performance Distributed Computing, IEEE Computer Society Press, Los Alamitos (1995)
2. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: FOCS, pp. 32–44 (1999)
3. Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: ACM Symposium on Theory of Computing (STOC), pp. 198–205 (1999)
4. Brixius, N., Linderoth, J., Goux, J.: Solving large quadratic assignment problems on computational grid. Mathematical Programming, Series B 91, 563–588 (2002)
5. Chakrabarti, S., Phillips, C., Schulz, A., Shmoys, D., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Proc. of the 23rd Int. Colloquium on Automata, Languages and Programming, pp. 646–657 (1996)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Recent Advances in Data Intensive Applications: Survey;2023 10th International Conference on Wireless Networks and Mobile Communications (WINCOM);2023-10-26
2. Concurrent Open Shops;International Series in Operations Research & Management Science;2021-10-31
3. SmartDis: Near-Optimal Task Scheduling in Multi-edge Networks;Edge Computing and IoT: Systems, Management and Security;2021
4. On Scheduling Coflows;Algorithmica;2020-07-15
5. Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time;Journal of the Operational Research Society;2020-02-06