정수계획법을 이용한 프로젝트 확장순서결정에 관한 연구

Abstract

Planning for the expansion of production capacity is of vital importance in many applications within the private and public sectors. This paper considers a sequencing expansion problem in which capacity can be added only at discrete points in time. Given the demand forecast of each period, capacity and cost of each expansion project, we are to determine the sequence of expansion necessary to provide sufficient capacity to meet the demand in all periods at minimum cost. This problem is formulated as a pure integer programming and solved by branch and bound method using Lagrangian relaxation. At first. simple sequencing expansion problem is presented, and in the latter part, extension to include precedence between projects is suggested.