Abstract
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. Note to Practitioners-Bridge cranes are commonly used to move heavy items in manufacturing and logistics systems. Generally, more than one crane runs on a common track. The latest versions of such cranes, such as those used in slab yards in the steel industry, can hold two items simultaneously. Operations scheduling of multiple double-load cranes involves the assignment of tasks to the cranes, the combination of tasks to double-load operations, and sequencing of the tasks, considering the noncrossing constraint between cranes. Effective solution of this complex problem can help to fully utilize the crane capability, increase productivity, and reduce energy consumption. This article models this problem and develops a heuristic solution that combines differential evolution (DE) and DP. Experiment results show that the algorithm is effective and efficient for practical use in slab yards. It may also be applicable to other systems using similar cranes.
Highlights
STEEL slabs are intermediate products in the steel production system
We develop a forward dynamic programming (DP) procedure to efficiently generate the schedule for the crane to perform the tasks
We have studied a multiple double-load crane scheduling problem in steel slab yards
Summary
STEEL slabs are intermediate products in the steel production system. They are produced in the continuouscasting stage and are used as materials in the hot-rolling stage. The hall is often divided into several areas in practice, such that each area is served by one crane With this practical strategy, a single-crane scheduling problem can be solved to optimize the operations of each storage area. Lieberman and Turksen [2] studied a crane scheduling problem in production systems, and proposed heuristic solutions considering situations where the tasks are ready at the same. Zheng et al [13] studied a crane scheduling problem with uncertain release times of retrieval tasks in a container yard. They proposed a two-stage stochastic programming model and developed a heuristic algorithm to solve the problem.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
