Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015 (2015), Article ID 618436, 12 pages
Research Article

Genetic Algorithm and Its Performance Analysis for Scheduling a Single Crane

1Key Laboratory of Manufacturing Industrial and Integrated Automation, Shenyang University, No. 21, WangHua South Street, Dadong District, Shenyang, Liaoning 110044, China
2Liaoning Institute of Standardization, No. 8, YongAn North Road, Heping District, Shenyang, Shenyang, Liaoning 110004, China

Received 21 August 2014; Revised 29 September 2014; Accepted 30 September 2014

Academic Editor: Peng Liu

Copyright © 2015 Xie Xie et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper studies a single crane scheduling problem arising in the cold-rolling material warehouse in an iron and steel enterprise. A set of coils stored in two levels are needed to be picked up and transported to designated positions. If a required coil is at the upper level, it can be picked up right away and transported to its designated position (transportation operation). A required coil at the lower level cannot be picked up until all its blocking coils at the upper level are moved to other positions (shuffling operation). One overhead crane is used to perform all the transportation and shuffling operations. Our problem is to schedule the crane operations so as to all required coils retrieve to their designated positions in the shortest possible time (makespan). Since the problem is shown to be NP-hard, a genetic algorithm (GA) is proposed. We identify some analytical properties which enable us to develop an effective heuristic algorithm as initial solutions of the GA. We further analyze its performance from the worst-case point of view. To evaluate the average performances, a numerical test compared with some existing methods is carried out and its results show the good quality of the proposed algorithm.