钢铁生产中具有不干涉约束的双吊机调度问题  

Two-Crane Scheduling Problem with Non-interference Constraint in Iron and Steel Production

作　　者：谢谢[1] 周莉[2] 郑勇跃 Xie Xie;Zhou Li;Zheng Yongyue(Key Laboratory of Manufacturing Industrial and Integrated Automation,Shenyang University,Shenyang 110044,China;China National Institute of Standardization,Beijing 100191,China;Liaoning Institute of Standardization,Shenyang 110004,China)

机构地区：[1]沈阳大学装备制造综合自动化重点实验室,辽宁沈阳110044 [2]中国标准化研究院,北京100191 [3]辽宁省标准化研究院,辽宁沈阳110004

出　　处：《沈阳大学学报（自然科学版）》2018年第4期294-298,共5页Journal of Shenyang University：Natural Science

基　　金：国家自然科学基金资助项目(71672117);辽宁省自然科学基金资助项目(201602526);辽宁省高等学校杰出青年学者成长计划资助项目(LJQ2014133)

摘　　要：通过探究钢铁企业精炼车间具有不干涉约束的双吊机调度问题的结构,设计了求解问题的有效的启发式算法,证明了该算法在2台吊机情况下的最坏性能比是4/3.进一步通过计算实验,并使用实际生产数据对所提出的算法进行测试,结果证明算法在可接受的时间内可以产生近优解.By investigating the structure of the two crane scheduling problem with non-interference constraint in the refining worldshop of the iron and steel company, an efficient heuristic algorithm for solving problems is designed. It is proved that the worst performance ratio of this algorithm in the case of two cranes is 4/3. furough further calculation experiments, and using the actual production data to test the proposed algorithm, the results prove that the algorithm can produce near optimal solutions within an acceptable time.

关 键 词：吊机调度 强NP难 启发式算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]