Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. Azar, Y., Epstein, L. Online machine covering. Algorithms-ESA’97, Lecture Notes in Computer Science 1284, Springer-Verlag, 1997, 23–36
2. Cao, S.J., Tan, Z.Y. Online uniform machine covering with the known largest size. Progress in Natural Science, 17(11): 1271–1278 (2007)
3. Deuermeyer, B.L., Friesen, D.K., Langston, M.A. Scheduling to maximize the minimum processing finish time in a multiprocessor system. SIAM J. Algebraic Discrete Methods, 3: 190–196 (1982)
4. Epstein, L. Tight bounds for bandwidth allocation on two links. Discrete Applied Mathematics, 148(2): 181–188 (2005)
5. Epstein, L., Ye, D.H. Semi-online scheduling with “end of sequence” information. Journal of Combinatorial Optimation, 14(1): 45–61 (2007)