检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王海瑶[1]
机构地区:[1]福建江夏学院,福州350108
出 处:《重庆科技学院学报(自然科学版)》2014年第6期103-107,共5页Journal of Chongqing University of Science and Technology:Natural Sciences Edition
基 金:福建省教育厅科研项目"制造车间物流瓶颈漂移闭环预测和控制方法研究"(JB12191);"不确定性环境下制造车间物流瓶颈漂移闭环预测和控制方法研究"(2012B010)
摘 要:对Job-shop调整时间与人员的指派关系进行研究,提出建立调整时间与人员相关的复杂车间调度模型,给出模型的求解方法。借鉴粒子群算法中的极值模式对遗传算法进行改进,并验证改进遗传算法的优越性;通过仿真实例模拟实际生产工况,对调整时间与人员技能水平相关模型进行分析。The relationship between job-shop set-up time and assignment problem was studied on the basis of workers of different skill levels adjust the machine by different time. A complex Job-shop scheduling model based on interaction between job-shop set-up time and assignment problem is proposed. Genetic Algorithm could be improved by the extreme value model of the particle swarm algorithm and then testify its superiority. The analysis and calculation model of set-up time on workers of different skill levels can not be neglected by the simulation based on real conditions. The results show that the model taking into account the level of staff skills is more accord with actual production scheduling field.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.26