Online Scheduling for Sorting Buffers-Reference-Cited by-同舟云学术

Online Scheduling for Sorting Buffers

Published:2002 Issue: Volume: Page:820-832
ISSN:0302-9743
Container-title:Algorithms — ESA 2002
language:
Short-container-title:

Author:

Räcke Harald,Sohler Christian,Westermann Matthias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45749-6_71

Reference11 articles.

1. T. Feder, R. Motwani, R. Panigrahy, and A. Zhu.Web caching with request reordering.In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA),pages 104–105,2002.

2. A. Fiat, R.M. Karp., M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive paging algorithms.Journal of Algorithms 12(2):685–699,1991.

3. C.B. Fraser and R.W. Irving. Approximation algorithms for the shortest common supersequence.Nordic Journal of Computing 2:303–325,1995.

4. M.J. Garey and D.S. Johnson.Computers and intractability: A guide to the theory of NP-completeness Freeman,1979.

5. T. Jiang and M. Li.On the approximation of shortest common supersequences and longest common subsequence. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP),pages 191–202,1994.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study;International Transactions in Operational Research;2021-08-27

2. Online Service with Delay;ACM Transactions on Algorithms;2021-08

3. Stochastic Dominance and the Bijective Ratio of Online Algorithms;Algorithmica;2019-10-29

4. Fixed-Order Scheduling on Parallel Machines;Integer Programming and Combinatorial Optimization;2019

5. Online Service with Delay on a Line;Structural Information and Communication Complexity;2018