수리 모형을 이용한 조선 산업에서의 블록 적치장 최적 운영 계획 도출
A Mathematical Programming Approach for Block Storage Problem in Shipbuilding Process
하병현(부산대학교); 손정열(대우조선해양 중앙연구소); 조규갑(부산대학교); 최병천(충남대학교)
30권 3호, 99~111쪽
초록
This paper studies the scheduling problem of storing and retrieving assembly blocks in a temporary storage yard. The objective is to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We present an integer programming model based on multi-commodity network flows, and the three revised models based on the properties of the problem. We show that the revised models are more efficient than the generic model through the numerical experiments.
Abstract
This paper studies the scheduling problem of storing and retrieving assembly blocks in a temporary storage yard. The objective is to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We present an integer programming model based on multi-commodity network flows, and the three revised models based on the properties of the problem. We show that the revised models are more efficient than the generic model through the numerical experiments.
- 발행기관:
- 한국경영과학회
- 분류:
- 경영학