Research on shipbuilding schedule based on genetic algorithm

The overall arrangement in shipbuilding project is a strategic problem, whose purpose is to obtain an optimal scheme with the shortest days for construction and the best economic benefits. Here a multiobjective model of shipbuilding schedule is proposed, and a new genetic algorithm based on a vector group encoding method in order to effectively solve it. The shipbuilding scheduling problem with minimizing the maximum completion time among all the jobs and minimizing the total earliness/tardiness penalty of all the jobs is a parallel machine scheduling one, but it is different from other parallel machine scheduling problems with the following characteristics. Firstly, the machines are non-identical; secondly, the sort of job processed on every machine can be restricted. For our proposed algorithm, its encoding method is simple and can effectively reflect the virtual scheduling policy, which can vividly reflect the numbers and sequences of these processed jobs on every machine, and enables the individuals generated by crossover and mutation to satisfy process constraint. Numerical results show that our proposed algorithm is efficient, and outperforms the common genetic algorithm.