Model and heuristic solutions for the multiple double-load crane scheduling problem in slab yards
journal contributionposted on 28.10.2019 by Guodong Zhao, Jiyin Liu, Lixin Tang, Ren Zhao, Yun Dong
Any type of content formally published in an academic journal, usually following a peer-review process.
This article studies a multiple double-load crane scheduling problem in steel slab yards. Consideration of multiple cranes and their double-load capability makes the scheduling problem more complex. This problem has not been studied previously. We first formulate the problem as a mixed-integer linear programming (MILP) model. A two-phase model-based heuristic is then proposed. To solve large problems, a pointer-based discrete differential evolution (PDDE) algorithm was developed with a dynamic programming (DP) algorithm embedded to solve the one-crane subproblem for a fixed sequence of tasks. Instances of real problems are collected from a steel company to test the performance of the solution methods. The experiment results show that the model can solve small problems optimally, and the solution greatly improves the schedule currently used in practice. The two-phase heuristic generates near-optimal solutions, but it can still only solve comparatively modest problems within reasonable (4 h) computational timeframes. The PDDE algorithm can solve large practical problems relatively quickly and provides better results than the two-phase heuristic solution, demonstrating its effectiveness and efficiency and therefore its suitability for practical use.
Fund for Innovative Research Groups of the National Natural Science Foundation of China (71621061), the Major International Joint Research Project of the National Natural Science Foundation of China (71520107004), General fund of the National Natural Science Foundation of China (71472081), and the 111 Project (B16009)
- Business and Economics