The Order Planning based on Load Balance for the Iron-Steel Plant
Based on load balance ideas, this paper constructs an integer programming model for the order planning of the steel-iron enterprise, whose objective is to minimize the total cost including earliness-tardiness penalty, load imbalance penalty, order cancellation penalty. According to the characteristics of the model, a scatter search algorithm with heuristic repaired strategy for infeasible solutions is designed. To examine algorithm’s efficiency and effectiveness, this paper also uses genetic algorithm to solve the model. Using several sets of practical order data as instances, this paper analyzes the two algorithms’ results. The numerical analysis shows that the model and the scatter search algorithm are valid.
order planning load balance mixed integer programming scatter search (SS) genetic algorithm (GA)
Tao Zhang Yuejie Zhang Lili Xu Zongjin Wang Yi Yu
School of Information Management and Engineering, Shanghai University of Finance and Economics, Shan School of Computer Science, Key Laboratory of Intelligent Information Processing, Fudan University,
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
2667-2672
2012-05-23（万方平台首次上网日期，不代表论文的发表时间）