Advertisement

A Constant Approximation Algorithm for Sorting Buffers

  • Jens S. Kohrt
  • Kirk Pruhs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)

Abstract

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.

Keywords

Optimal Schedule Input Sequence Approximation Factor Interval Graph Output Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bar-Noy, A., Bar-Yehuda, R., Freund, A., Seffi Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM 48(5), 1069–1090 (2001)CrossRefMathSciNetGoogle Scholar
  2. 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. 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
  4. 4.
    Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: An Optimal Solution for the Channel-Assignment Problem. IEEE Transactions on Computers 28(11), 807–810 (1979)zbMATHCrossRefGoogle Scholar
  5. 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
  6. 6.
    Räcke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, p. 820. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jens S. Kohrt
    • 1
  • Kirk Pruhs
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark
  2. 2.Computer Science DepartmentUniversity of Pittsburgh 

Personalised recommendations