Author:
Aerts Joep,Korst Jan,Spieksma Frits
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Adams, W.P., J. Bowers Lassiter, and H.D. Sherali (1998), Persistency in 0–1 polynomial programming, Mathematics of Operations Research 23, 359–389.
2. Aerts, J., J. Korst, F. Spieksma, W. Verhaegh, and G. Woeginger (2002), Load balancing in disk arrays: complexity of retrieval problems, to appear in IEEE Transactions on Computers.
3. Aerts, J., J. Korst, and W. Verhaegh (2001), Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility, Journal of Scheduling 4, 245–257.
4. Aerts, J., J. Korst, and W. Verhaegh (2002), Improving disk efficiency in video servers by random redundant storage, To appear in the Proceedings of the 6th IASTED International Conference on Internet and Multimedia Systems and Applications (August 2002).
5. Chudak, F. and D.S. Hochbaum, (1999), A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine, Operations Research Letters 25, 199–204.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献