Browse > Article
http://dx.doi.org/10.7232/IEIF.2011.24.1.078

Spatial Scheduling for Mega-block Assembly Yard in Shipbuilding Company  

Koh, Shie-Gheun (Dept of Systems Management and Engineering, Pukyong National University)
Jang, Jeong-Hee (Nexen Tire Co., Ltd)
Choi, Dae-Won (SCM Consulting Team, Samsung SDS Co., Ltd)
Woo, Sang-Bok (SCM Consulting Team, Samsung SDS Co., Ltd)
Publication Information
IE interfaces / v.24, no.1, 2011 , pp. 78-86 More about this Journal
Abstract
To mitigate space restriction and to raise productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that can lift very heavy objects (up to 3,600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and so, very large blocks (these are called the mega-blocks) can be used to build a ship. But, because these mega-blocks can be made only in the area near the floating-dock and beside the sea, the space is very important resource for the process. Therefore, our problem is to make an efficient spatial schedule for the mega-block assembly yard. First of all, we formulate this situation into a mathematical model and find optimal solution for a small problem using a commercial optimization software. But, the software could not give optimal solutions for practical sized problems in a reasonable time, and so we propose a GA-based heuristic algorithm. Through a numerical experiment, finally, we show that the spatial scheduling algorithm can provide a very good performance.
Keywords
shipbuilding; floating-dock; pre-erection; mega-block; spatial schedule;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Lim, A. (1998), The berth planning problem, Operations Research Letters, 22, 105-110.   DOI   ScienceOn
2 Lodi, A., Martello, S., and Monaci, M. (2002), Two-dimensional packing problems: A survey, European Journal of Operational Research, 141, 241-252.   DOI   ScienceOn
3 Park, K. T. and Kim, K. H. (2002), Berth scheduling for container terminals by using a sub-gradient optimization technique, Journal of the Operational Research Society, 53, 1054-1062.   DOI   ScienceOn
4 Imai, A., Sun, X., Nishimura, E., and Papadimitriou, S. (2005), Berth allocation in a container port : using a continuous location space approach, Transportation Research Part B, 39, 199-221.   DOI   ScienceOn
5 Kim, K. H. and Moon, K. C. (2003), Berth scheduling by simulated annealing, Transportation Research Part B, 37, 541-560.   DOI   ScienceOn
6 Lee, Y. and Chen, C.-Y. (2009), An optimization heuristic for the berth scheduling problem, European Journal of Operational Research, 196, 500-508.   DOI   ScienceOn