Spatial scheduling for shape-changing mega-blocks in a shipbuilding company

To overcome space restriction and to increase productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that is capable of lifting very heavy objects (up to 3600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and therefore, very large blocks (also called mega-blocks) can be used to build a ship, but because there are some positional restrictions under which the mega-block assembly yard can be constructed, the space is the scarcest resource in the process. The focus of the research reported in this paper is to develop an efficient spatial schedule for the mega-block assembly yard. First, we develop a length-time two-dimensional packing model for this problem. Since the optimisation model cannot be solved using an analytical method, we propose a GA-based heuristic algorithm using computational geometry theory. Through performing a series of computational experiments, we finally show that the proposed spatial scheduling algorithm can provide solutions of good quality very efficiently.

[1]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[2]  Yusin Lee,et al.  An optimization heuristic for the berth scheduling problem , 2009, Eur. J. Oper. Res..

[3]  Ruddell Reed,et al.  An applied model for the facilities design problem , 1976 .

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Shie-Gheun Koh,et al.  Spatial Scheduling for Mega-block Assembly Yard in Shipbuilding Company , 2011 .

[6]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[7]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

[8]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[9]  Jae Kyu Lee,et al.  A spatial scheduling system and its application to shipbuilding: DAS-CURVE , 1996 .

[10]  Shie-Gheun Koh,et al.  Development of a Block Assembly Scheduling System for Shipbuilding Company , 1999 .

[11]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[12]  R. C. Lee,et al.  CORELAP: Computerized relationship layout planning , 1967 .

[13]  Zhibin Jiang,et al.  Spatial scheduling algorithm minimising makespan at block assembly shop in shipbuilding , 2011 .

[14]  Changkyu Park,et al.  A spatial scheduling application at the block paint shop in shipbuilding: the HYPOS project , 2002 .

[15]  Yeong-Dae Kim,et al.  Algorithms for adjusting shapes of departments in block layouts on the grid-based plane , 2000 .

[16]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[17]  Kyungsik Lee,et al.  Modeling and solving the spatial block scheduling problem in a shipbuilding company , 1996 .