A Constant Approximation Algorithm for Sorting Buffers
We consider an algorithmic problem that arises in manufacturing applications. The input is a sequence of objects of various types. The scheduler is fed the objects in the sequence one by one, and is equipped with a finite buffer. The goal of the scheduler/sorter is to maximally reduce the number of type transitions. We give the first polynomial-time constant approximation algorithm for this problem. We prove several lemmas about the combinatorial structure of optimal solutions that may be useful in future research, and we show that the unified algorithm based on the local ratio lemma performs well for a slightly larger class of problems than was apparently previously known.
KeywordsOptimal Schedule Input Sequence Approximation Factor Interval Graph Output Sequence
Unable to display preview. Download preview PDF.
- 2.Brückner, S., Wyns, J., Peeters, P., Kollingbaum, M.: Designing agent for manufacturing control. In: Proceedings of the 2nd AI & Manufacturing Research Planning Workshop, pp. 40–46 (1998)Google Scholar
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, ch. 16, 2nd edn. MIT Press and McGraw-Hill Book Company (2001)Google Scholar
- 5.Kohrt, J.S., Pruhs, K.: A constant approximation algorithm for sorting buffers. Technical Report PP-2003-21, Department of Mathematics and Computer Science, University of Southern Denmark, Odense (2003)Google Scholar
- 7.Sokol, J.S.: Optimizing Paint Blocking in an Automobile Assembly Line: An Application of Specialized TSP’s. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (June 1999)Google Scholar