The Buffer Allocation with Linear Resource Constraints in a Continuous Flow Line

자원제약조건을 갖는 연속흐름라인에서 Buffer 의 할당에 관한 연구

An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.