Efficient algorithms for buffer allocation

We describe four efficient algorithms for allocating buffer space in a transfer line where the machines are specified. The objectives of these algorithms are to (1) minimize total buffer space while meeting a production rate constraint, (2) maximize production rate for a specified total buffer space, (3) maximize the profitability of a transfer Line for a specified total buffer space and (4) maximize the profitability of a transfer line with no total buffer space constraint. The first two problem formulations ignore inventory costs while the third and fourth formulations include inventory costs. These problems are solved using the deterministic processing time and the continuous material flow transfer line models. The DDX and ADDX algorithms are used to evaluate the production rate and average inventory for these models. These evaluation routines are very efficient, enabling our optimization algorithms to quickly calculate buffer sizes for transfer lines consisting of twenty or more machines.