DocumentCode
2318940
Title
Stacker-reclaimer scheduling for raw material yard operation
Author
Hu, Dayong ; Yao, Zhenqiang
Author_Institution
Sch. of Mech. Eng., Shanghai Jiao Tong Univ., Shanghai, China
fYear
2010
fDate
25-27 Aug. 2010
Firstpage
432
Lastpage
436
Abstract
Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.
Keywords
integer programming; materials handling; scheduling; NP-hard problem; inbound raw materials; mixed integer programming model; optimal operation sequence; outbound raw materials; parthenogenetic algorithm; raw material handling; raw material yard operation; stacker-reclaimer scheduling; Biological cells; Containers; Genetics; Parallel machines; Raw materials; Schedules; Scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computational Intelligence (IWACI), 2010 Third International Workshop on
Conference_Location
Suzhou, Jiangsu
Print_ISBN
978-1-4244-6334-3
Type
conf
DOI
10.1109/IWACI.2010.5585235
Filename
5585235
Link To Document