A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Evaluation of online strategies for reordering buffers
Journal of Experimental Algorithmics (JEA)
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Improved online algorithms for the sorting buffer problem on line metrics
ACM Transactions on Algorithms (TALG)
Online and offline algorithms for the sorting buffers problem on the line metric
Journal of Discrete Algorithms
An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A note on sorting buffers offline
Theoretical Computer Science
NP-hardness of the sorting buffer problem on the uniform metric
Discrete Applied Mathematics
| Hi-index | 0.00 |
The sorting buffers problem is motivated by many applications in manufacturing processes and computer science, among them car-painting and file servers architecture. The input is a sequence of items of various types. All the items must be processed, one by one, by a service station. We are given a random-access sorting buffer with a limited capacity. Whenever a new item arrives it may be moved directly to the service station or stored in the buffer. Also, at any time items can be removed from the buffer and assigned to the service station. Our goal is to give the service station a sequence of items with minimum type transitions. We generalize the problem to allow items with different sizes and type transitions with different costs. We give a polynomial-time 9-approximation algorithm for the maximization variant of this problem, which improves the best previously known 20-approximation algorithm.