DOI QR코드

DOI QR Code

Spatial Scheduling for Mega-block Assembly Yard in Shipbuilding Company

조선소의 메가블록 조립작업장을 위한 공간계획알고리즘 개발

  • Received : 2010.03.22
  • Accepted : 2010.10.21
  • Published : 2011.03.01

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

References

  1. 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. https://doi.org/10.1016/j.trb.2004.04.004
  2. Kim, K. H. and Moon, K. C. (2003), Berth scheduling by simulated annealing, Transportation Research Part B, 37, 541-560. https://doi.org/10.1016/S0191-2615(02)00027-9
  3. Lee, Y. and Chen, C.-Y. (2009), An optimization heuristic for the berth scheduling problem, European Journal of Operational Research, 196, 500-508. https://doi.org/10.1016/j.ejor.2008.03.021
  4. Lim, A. (1998), The berth planning problem, Operations Research Letters, 22, 105-110. https://doi.org/10.1016/S0167-6377(98)00010-8
  5. Lodi, A., Martello, S., and Monaci, M. (2002), Two-dimensional packing problems: A survey, European Journal of Operational Research, 141, 241-252. https://doi.org/10.1016/S0377-2217(02)00123-6
  6. 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. https://doi.org/10.1057/palgrave.jors.2601412

Cited by

  1. Spatial scheduling for shape-changing mega-blocks in a shipbuilding company vol.49, pp.23, 2011, https://doi.org/10.1080/00207543.2010.535863
  2. Optimization of P.E. area division and arrangement based on product mix vol.19, pp.4, 2014, https://doi.org/10.1007/s00773-014-0274-1
  3. Quay Wall Scheduling of Ships Using Assignment Method and Tabu Search Algorithm vol.41, pp.1, 2015, https://doi.org/10.7232/JKIIE.2015.41.1.001
  4. Research Trends of Scheduling Techniques for Domestic Major Industries vol.41, pp.1, 2018, https://doi.org/10.11627/jkise.2018.41.1.059