STUDY FOR ROLLING PLANNING PROBLEM WITH ROLLER COST

摘要：

　　The problem of rolling planning and adjusting is studied on the basis of cutting cost in this paper.A 0-1 integer programming model is established with an objective of minimizing the total cutting cost of rolling plan.Considering the characteristics of the problem, a two-stage heuristic algorithm based on matching and adjusting is constructed.Some experiments with actual production data are performed.The results show that the cutting quantity is reduced significantly relative to the traditional artificial method.The model and algorithm are feasible and effective.

关键词： Cutting Cost Integer Programming Rolling Planning Heuristic Algorithm

作者: Guangjing Dong Zhiwei Luan Bailin Wang Tieke Li

作者单位: Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing 1 Engineering Research Center of MES Technology for Iron & Steel Production, Ministry of Education,Bei

会议类型: 国际会议

会议名称: The 12th International Conference on Industrial Management(第十二届工业管理国际会议)

会议地点: 成都

会议语种:英文

页码: 60-65

在线出版日期: 2014-09-03（万方平台首次上网日期，不代表论文的发表时间）