检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东工业大学机电工程学院,广东广州510006
出 处:《工业工程》2017年第3期53-59,共7页Industrial Engineering Journal
基 金:国家自然科学基金资助项目(71402033)
摘 要:以某冷柜公司门组生产系统为对象,研究了具有有限缓冲的两生产阶段排序问题,考虑该车间的发泡设备约束,分别对预装线投产排序与发泡线模具排序进行研究,以使得预装线与发泡线的运行尽可能匹配,有效地减少了发泡模具空模数量与在制品库存数量。特别设计库存量计算算法来计算空模数量与在制品库存数量,通过改进遗传算法分别求解两个阶段的排序方案。最后通过案例分析及算例对比验证了算法的有效性。With a freezer door production system of a freezer company as an object, two production scheduling problems with limited buffer are studied. Considering the foaming equipment constraints of this workshop, research is conducted respectively on sequencing of production in the pre-assembly line and that of mould in the foaming line, in order to make the pre-assembly line match with the foaming line as much as possible, thus effectively reducing the number of empty foaming moulds and that of the average work-in-process inventory. Special inventory algorithms are designed to calculate the number of empty foaming moulds and that of average work-in-process inventory, and to respectively solve the two stages through the improved genetic algorithms. Finally, a case analysis with numerical examples verifies the effectiveness of the algorithms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145