The Buffer Allocation Problem

The buffer allocation problem, BAP, is concerned with the allocation of a certain fixed number of buffer slots, N, among the K−1 intermediate buffer locations of a production line in order to meet some specified objective. The number of stations of the line is fixed at K, the number of servers assigned to each station is fixed and the work allocation $${\bf w} = ({w}_{1},{w}_{2}, \ldots ,{w}_{K})$$ is also fixed. The buffer allocation problem is of particular interest to operations management in that in many practical production line situations, the allocation of buffer space may be the primary flexibility available to the organization. Clearly, buffer space is an expensive resource and so, ideally models involving cost considerations are very desirable. Of course, there are also plant layout issues involved. At least three buffer allocation problems have been identified in the literature and these are described in Section 5.1. Solutions of the buffer allocation problems are discussed in Section 5.2. Special solution approaches to buffer allocation problems in short lines are the subject of Section 5.3, whereas solution approaches to buffer allocation problems in longer lines are treated in Section 5.4.