Author:
Jiang Yi-wei,Hu Jue-liang,Weng Ze-wei,Zhu Yu-qing
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Y Azar, L Epstein. Approximation schemes for covering and scheduling on related machines machine covering, Proc of APPROX’1998, 1998, 39–47.
2. O Braun, G Schmidt. Parallel processor scheduling with limited number of preemptions, SIAMJ Comput, 2003, 32(3): 671–80.
3. J R Correa, M Skutella, J Verschae. The power of preemption in unrelated machines and applications to scheduling orders, Math Oper Res, 2012, 37(2): 379–398.
4. J Csirik, H Kellerer, G Woeginger. The exact LPT-bound for maximizing the minimum completion time, Oper Res Lett, 1992, 11: 281–287.
5. B Deuermeyer, D Friesen, M Langston. Scheduling to maximize the minimum processor finish time in a multiprocessor system, SIAM J Discrete Methods, 1982, 3: 190–196.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献