Author:
Dürr Christoph,Jeż Łukasz,Thang Nguyen Kim
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference15 articles.
1. Awerbuch, B., Bartal, Y., Fiat, A., & Rosén, A. (1994). Competitive non-preemptive call control. In Proc. 5th symp. on discrete algorithms (pp. 312–320).
2. Baptiste, P. (1999). An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24(4), 175–180.
3. Baptiste, P., Chrobak, M., Dürr, C., Jawor, W., & Vakhania, N. (2004). Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters, 32(3), 258–264.
4. Baruah, S., Haritsa, J., & Sharma, N. (1994). On-line scheduling to maximize task completions. In Real-time systems symposium (pp. 228–236).
5. Canetti, R., & Irani, S. (1998). Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing, 27(4), 993–1015.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献