Abstract: To efficiently solve the spatial scheduling problem (SSP) for blocks in shipbuilding, a priority rule-based solution algorithm is proposed. Firstly, feasible scheduling sequences of blocks are generated by combining priority rules and the Taboo search algorithm. And then, these feasible scheduling sequences are decoded and evaluated using a heuristic location strategy, which is called the bottom-left-fill (BLF) strategy. The approximate optimal solution can be obtained in the process of algorithm iteration. Based on the actual data of a shipyard, an empirical analysis is carried out. The effectiveness and superiority of the proposed algorithm are verified by comparing with existing algorithms.