Author:
Epstein Leah,Zebedat-Haider Hanan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference17 articles.
1. Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13(1), 64–78.
2. Bruno, J., & Gonzalez, T. (1976). Scheduling independent tasks with release dates and due dates on parallel machines. Technical report 213. University Park: Computer Science Department, The Pennsylvania State University.
3. Chen, B., van Vliet, A., & Woeginger, G. J. (1995). An optimal algorithm for preemptive on-line scheduling. Operations Research Letters, 18(3), 127–131.
4. Cho, Y., & Sahni, S. (1980). Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1), 91–103.
5. Dósa, G., & He, Y. (2006). Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing, 76(1–2), 149–164.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献