In modern shipbuilding industry, all the works are limited by space. So how to maximize the use of limited space in the shipbuilding factory has become a very important problem. By other hand, there have so many step in one ship building workflow, different step have the different requirement for block assignment problem. In this paper we discussed two kinds of block assignment problem in shipbuilding factory. Each kind of block assignment problem is modeled and solved. And given two different charts to solved the two kinds of block assignment problem. Solved the intractable nature of this problem is ignited us to use interactive genetic algorithms with a specialized operator called “repair”. In addition some domain knowledge has been incorporated during the process of exploration and exploitation of an optimal assignment. The experimental study confirms that the incorporation of the domain knowledge and a new repair operator in genetic algorithms leads to faster convergence and at the same time it reduces the local optimality.
