一种有到达时间的多处理器混合流水车间调度的遗传算法(英文)  

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessors and Release Dates

作　　者：卢申朋[1] 冯好娣[1] 刘宏[1] 栾峻峰[1] 

机构地区：[1]山东大学计算机科学与技术学院,济南250101

出　　处：《计算机与数字工程》2008年第10期5-11,24,共8页Computer & Digital Engineering

基　　金：国家自然科学基金(编号:60603007)资助;山东省自然科学基金项目(编号:Q2006G01)资助

摘　　要：有到达时间的多处理器混合流水车间调度问题在实时机器视觉系统等领域有广泛的应用。这一问题是NP-困难的。鉴于以上原因,给出一种遗传算法。对不同的交叉算子和变异算子以及涉及的参数的不同取值进行试验,并对试验的结果进行分析和讨论,从而给出最好的参数组合。The hybrid flow-shop scheduling problem with multiprocessors and release dates may find its applications in real-time machine-vision systems among others. This problem is well known as NP-hard. Motivated by the above reasons, a genetic algorithm has been proposed in this work. The algorithm by trying different crossover operators and mutation operators along with different settings of the involved parameters have been implemented. The experiment results and concluded the best settings have been analyzed and discussed at last.

关 键 词：多处理器调度 混合流水车间 遗传算法 到达时间 

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