检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京科技大学东凌经济管理学院,北京100083 [2]钢铁生产制造执行系统技术教育部工程研究中心,北京100083
出 处:《计算机集成制造系统》2016年第10期2355-2362,共8页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(71231001);中央高校基本科研业务费专项资金资助项目(FRF-SD-12-011B;FRF-SD-12-012B);教育部博士学科点专项科研基金资助项目(20100006110006)~~
摘 要:为解决热轧无缝纲管在多工艺路线下的订单排程问题,将工艺路线因素引入热轧钢管订单排程中,建立了以合理的工艺路线切换、最小化机器设备调整和准时制生产为优化目标的约束满足模型,并设计了求解算法。该算法根据模型特征,提出基于降序最佳适应的约束满足算法和基于约束的聚类算法,对订单进行整理并形成初始轧制计划;设计了两种批次交换搜索算法,分别对单日内及日间的初始轧制批次进行排程优化。通过基于实际订单数据的实验讨论了上述算法两两组合的求解效果和各自的适用情况,验证了模型和算法的可行性和有效性。To solve the order scheduling problem of hot rolling seamless steel pipe under multi process route, routing factor was introduced into hot-rolled seamless steel pipe order scheduling problem. For the problem, a constraint satisfaction model was established with the objectives of reasonable process switching, equipment adjustment mini- mizing and just-in-time production. Furthermore, algorithms were designed. According to the characteristics of this model, the best-fit-decreasing-based constraint satisfaction algorithm and constraint-based clustering algorithm were presented to generate an initial roiling plan two kinds of batch swap search algorithms were designed to optimize the initial rolling batch scheduling of the single day and the days respectively. Through experiments based on actual or- der data, the performances and application situations of algorithms combined the above methods in pairs were dis- cussed, and the feasibility and effectiveness of the proposed model and algorithms were verified.
分 类 号:TP29[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28