Generalized Reordering Buffer Management

  title={Generalized Reordering Buffer Management},
  author={Yossi Azar and Matthias Englert and Iftah Gamzu and Eytan Kidron},
An instance of the generalized reordering buffer management problem consists of a service station that has k servers, each configured with a color, and a buffer of size b. The station needs to serve an online stream of colored items. Whenever an item arrives, it is stored in the buffer. At any point in time, a currently pending item can be served by switching a server to its color. The objective is to serve all items in a way that minimizes the number of servers color switches. This problem… CONTINUE READING