A Mathematical Programming Approach for Block Storage Problem in Shipbuilding Process

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.

A Heuristic Algorithm for Block Storage Planning in Shipbuilding

“…특히 공장 내에서 공간제약과 일 정을 고려하여 공간 효율성을 극대화, 생산 시간을 최소화하기 위하여 블록위치를 결정하는 공간 일정 계획에 관한 많은 연구가 수행되어 왔다 Park, et al, 1996;Koh, et al, 1999;Cho, et al, 2001) (Park & Seo, 2009;Park & Seo, 2010). 적 치장 내 블록의 다양한 크기와 이동 방향의 자유도를 부여하여 재취급 횟수를 줄이는 연구가 진행되으나 (Lee, et al, 2011) (Ha, et al, 2013 Step 1.     ∪  으로 놓는다.…”