The dynamic scheduling algorithm based on heuristic rule

DOI

10.2991/ifmeita-16.2016.121How to use a DOI?

Keywords

spatial scheduling; algorithm; punctuality; efficiency; batch rule; greedy rule;

Abstract

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.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yan Ge
AU  - Aimin Wang
AU  - Jincheng Cheng
PY  - 2016/01
DA  - 2016/01
TI  - The dynamic scheduling algorithm based on heuristic rule
BT  - Proceedings of the 2016 International Forum on Management, Education and Information Technology Application
PB  - Atlantis Press
SP  - 658
EP  - 663
SN  - 2352-5398
UR  - https://doi.org/10.2991/ifmeita-16.2016.121
DO  - 10.2991/ifmeita-16.2016.121
ID  - Ge2016/01
ER  -