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

Xie Xie; Xiang Yu Kong; Yong Yue Zheng; Kun Wei

doi:10.4028/www.scientific.net/AMM.620.179

Paper Titles

Distribution Substation Site Planning Method Summary and Discussion
p.158

Research of the Design and Simulation of Ultrasonic Focusing System with Phased Array
p.162

Coanda Effect on the Impact of Distribution Characteristics of Oil-Air Annular Flow
p.166

Optimization of Multiple Performances for EDM in Gas Media Using Grey Relational Analysis
p.173

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

Cold-Formed Thin-Walled Steel Framing Residential System
p.183

Research on Recovery Technology of the By-Product Low-Pressure Steam of Ammonia
p.187

Generation of Technological Model for Multi-Stage Incremental Forming
p.192

Research on Cam Contour Error of Grinding Machining
p.199

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 620A Heuristic Algorithm for Solving Multi-Crane...

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

Abstract:

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.

You might also be interested in these eBooks

Industrial Engineering and Applied Research

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 620)

Pages:

179-182

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.620.179

Citation:

Cite this paper

Online since:

August 2014

Authors:

Xie Xie*, Xiang Yu Kong, Yong Yue Zheng, Kun Wei

Keywords:

Absolute Performance Analysis, Batch Annealing Process, Crane Scheduling, Heuristic Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] A.P. Catherine, B.H. Leonardo, B. Philippe, A two-stage methodology for short-term batch plant scheduling: discrete-event simulation and generic algorithm, Computers & Chemical Engineering, 22 (1998) 1461-1481.

DOI: 10.1016/s0098-1354(98)80033-1

Google Scholar

[2] S. Moon, A.N. Hrymak, Scheduling of the batch annealing process-deterministic case, Computers & Chemical Engineering, 23 (1999) 1193-1208.

DOI: 10.1016/s0098-1354(99)00285-9

Google Scholar

[3] Q.L. Liu, W. Wang, H.R. Zhan, Z.G. Wang, R.G. Liu, Optimal scheduling method for bell-type batch annealing shop and its application, Control Engineering Practice, 13 (2005) 1315-1325.

DOI: 10.1016/j.conengprac.2004.11.017

Google Scholar

[4] L.X. Tang, X. Xie, J.Y. Liu, Scheduling of a single crane in batch annealing process, Computers & Operations Research, 36 (2009) 2853-2865.

DOI: 10.1016/j.cor.2008.12.014

Google Scholar

[5] X. Xie, L.X. Tang, Crane Scheduling in Batch Annealing Process, in: Proceedings of the IEEE International Conference on Automation and Logistics, Qingdao, China, (2008).

DOI: 10.1109/ical.2008.4636494

Google Scholar