检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾强[1] 邓敬源[1] 常梦辉 张进春[1] ZENG Qiang;DENG Jingyuan;CHANG Menghui;ZHANG Jinchun(School of Energy Science and Engineering,Henan Polytechnic University,Jiaozuo,Henan,454000)
机构地区:[1]河南理工大学能源科学与工程学院,焦作454000
出 处:《中国机械工程》2018年第22期2690-2702,共13页China Mechanical Engineering
基 金:国家自然科学基金资助项目(51774113);河南省高等学校重点科研项目(19A4100013);河南理工大学博士基金资助项目(B2011-088)
摘 要:针对一类混合工作日历下的作业车间调度问题,提出了一种遗传进化方法。构建了混合工作日历下以生产周期最短为优化目标的作业车间调度优化模型;提出了基于工作日历的时间推算方法,设计了遗传算法对这类问题进行求解。算法采用基于工序的编码方式;遗传操作中采用遗传算子改进策略保证子代个体的可行性,降低了计算量;解码操作中采用了基于工作日历的时间推算方法来准确计算工序的起止时刻,并采用两种技术缩短生产周期。通过案例分析验证了所提方法的有效性。A genetic evolution method was presented to solve a kind of JSP under mixed work calendars.Firstly,a job shop scheduling optimization model was established under mixed work calendars to minimize production cycle.Secondly,a time reckoning method was proposed based on work calendar,and a GA was designed to solve the problems above.The process-based encoding method was used to encode chromosomes.An improved strategy of genetic operators was used in genetic operations to ensure feasibility of chromosomes and reduce calculation amounts.In decoding operation,the proposed time reckoning method was used to calculate start time and end time of each operation accurately based on the work calendar,and two techniques were adopted to shorten production cycle.Finally,application results show that the proposed method may solve the JSP under mixed work calendars effectively.
关 键 词:作业车间调度问题 混合工作日历 遗传算法 时间推算
分 类 号:C93-03[经济管理—管理学] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.65.88