Research on the Crane Scheduling for the Process of Steelmaking-continuous Casting based on Multilevel Heuristic Algorithm

2018 ◽  
Author(s):  
Liangliang Sun ◽  
Li Zhang ◽  
Xuebin Liu ◽  
Wei Liu
Keyword(s):  
Continuous Casting ◽  
Heuristic Algorithm ◽  
Crane Scheduling

An Efficient Heuristic Algorithm for Solving Crane Scheduling Problem

2013 ◽  
Vol 442 ◽  
pp. 443-449
Author(s):  
Xie Xie ◽  
Yan Ping Li ◽  
Yong Yue Zheng ◽  
Xiao Li Li
Keyword(s):  
Heuristic Algorithm ◽  
Mixed Integer Linear Programming ◽  
Numerical Experiments ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Crane Scheduling ◽  
Technological Requirement ◽  
Iron And Steel ◽  
Analytical Properties ◽  
Upper Level

This paper focuses on a single crane scheduling problem which is motivated by cooled-rolling material warehouse in the iron and steel enterprise. As storage technological requirement, coils have been stored on the pre-specified position in two levels. If a demanded coil is in the upper level, it can be picked up directly. If a demanded coil in the lower level is blocked by un-demanded coils, the coil can not be transported until all the blocking coils are shuffled to another position. Our problem combines transportation and shuffling simultaneously for crane to pick up all demanded coils as early as possible to designated place (makespan). We first propose a mixed integer linear programming (MILP) model. Some analytical properties are further provided. Based on these properties, we propose a polynomial-time heuristic algorithm. Numerical experiments are carried out to confirm our proposed methods can provide high quality solutions.

A Heuristic Algorithm for Solving Multi-Crane Scheduling Problem in Batch Annealing Process

2014 ◽  
Vol 620 ◽  
pp. 179-182 ◽  
Author(s):  
Xie Xie ◽  
Xiang Yu Kong ◽  
Yong Yue Zheng ◽  
Kun Wei
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Annealing Process ◽  
Performance Bound ◽  
Crane Scheduling ◽  
Iron And Steel ◽  
Heating And Cooling ◽  
Batch Annealing ◽  
Special Machine ◽  
No Wait

This paper investigates the scheduling of the multi-crane operations in batch annealing process in an iron and steel enterprise so that the completion time of the last annealed coil (makespan) is minimized. The annealing process of each coil consists of two-stage: heating and cooling. To start heating (cooling) for each coil, a special machine named furnace (cooler) must be loaded on. Once the heating (cooling) is completed, the furnace (cooler) must be unloaded immediately without any delay by crane (job no-wait constraint). The aim of our studied problem is to schedule finite machines (furnaces and coolers) by cranes to process jobs under the consideration for avoiding collision between two adjacent cranes and satisfying job no-wait constraint. For solving the problem, we present a heuristic algorithm combining earliest job requirement and closest crane first. Through the theoretical analysis, we show the absolute performance bound of the proposed heuristic algorithm.

Heuristic Algorithm for Solving Multi-Crane Scheduling in Steel Coil Warehouse

2014 ◽  
Vol 543-547 ◽  
pp. 1559-1562
Author(s):  
Xie Xie ◽  
Xiang Yu Kong ◽  
Yong Yue Zheng ◽  
Yan Ping Li
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Scheduling Problem ◽  
Np Hard ◽  
Crane Scheduling ◽  
Steel Coil ◽  
Upper Level ◽  
Warehouse Operations

We consider a multi-crane scheduling problem commonly encountered in real warehouse operations in steel enterprises. Given some demanded coils, if a demanded coil is in upper level or in lower level without being blocked, it can be picked up directly to designated place; else, the blocking coils need to be picked up to another position first. Unlike previous literatures in which both operations have been considered to be scheduled separately, our problem schedules transportation operation and shuffling operation coordinately. The objective is to minimize the last demanded coil transported to its designated place which is consistent with the earliest possible completion time of one crane. We propose a heuristic algorithm for solving this demonstrated strongly NP-hard.

Sign in / Sign up

Export Citation Format

Share Document