Variable neighborhood search based multi-objective dynamic crane scheduling
The paper researches a scheduling method based on variable neighborhood search (VNS) for a dynamic crane scheduling problem abstracted from steel making process in the iron and steel enterprise with random torpedo car arrivals and empty ladle breakdowns. Our objective is to minimize both makespan and total tardiness. At any rescheduling point, weights derived from artificial neural network (ANN), proper parameters for VNS are calculated that significantly enhances the performance of the scheduling method. Computational experiments indicate that the proposed method is better than those of common heuristic rules.
component dynamic crane scheduling artificial neural network variable neighborhood search
Xie Xie Yanping Li Huibo Zhou Yongyue Zheng
Key Laboratory of Manufacturing Industrial and Integrated Automation, Shenyang University Shenyang, School of mathematical science, Harbin normal University Harbin, China Liaoning Institute of standardization, Shenyang, China
国际会议
2012 International Conference on Measurement,Information and Control(2012测量、信息与控制国际会议 ICMIC2012)
哈尔滨
英文
457-460
2012-05-18(万方平台首次上网日期,不代表论文的发表时间)