Modeling and solving the spatial block scheduling problem in a shipbuilding company

We consider the block scheduling problem arising in a shipyard. The problem is complicated since we are considering both scheduling and spatial allocation of each block simultaneously. Moreover, varying conditions in several work spaces should be reflected. We develop a scheduling algorithm using partial enumeration and decompostion. An efficient heuristic search procedure for the spatial allocation of blocks is also devised.