The dynamic scheduling algorithm based on heuristic rule

摘要

To deal with the problems in shipbuilding spatial scheduling with rectangular workplace and rectangular blocks, a dynamic scheduling algorithm based on heuristic rule was put forward. The algorithm consists of two rules to achieve the multi-day scheduling and guarantees the punctuality of blocks and the efficiency of the workplace at the same time. The batch rule was proposed to segment the blocks in batches according to their earliest start time. The greedy rule based on dynamic programming was put forward to determine the location of the blocks in the field and maximize the efficiency of the workplace. Finally, a program was developed with the actual data of a shipyard to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm obtains satisfactory results in all indexes mentioned above.