Author:
Chrobak Marek,Dürr Christoph,Jawor Wojciech,Kowalik Łukasz,Kurowski Maciej
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference5 articles.
1. Baptiste, P., “Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times,” Journal of Scheduling, 2, 245–252 (1999).
2. Carlier J., “Problémes d'ordonnancement à durées égales”, QUESTIO, 5(4), 219–228 (1981).
3. Chrobak M., C. Dürr, W. Jawor, Ł. Kowalik, and M. Kurowski, “A note on scheduling equal-length jobs to maximize throughput”, technical report, arxiv.org, 2004.
4. Garey M., D. Johnson, B. Simons, and R. Tarjan, “Scheduling unit-time tasks with arbitrary release times and deadlines,” SIAM Journal on Computing, 10(2),256–269 (1981).
5. Simons. B., “A fast algorithm for single processor scheduling,” in Proceedings IEEE 19th Annual Symposium on Foundations of Computer Science (FOCS'78), 1978 pp. 246–252.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献