PBIL ALGORITHM FOR FLEXIBLE JOB-SHOP PROBLEM

摘要：

Because of the high computational complexity, scheduling for the flexible job-shop is a complex combinatorial problem and quite difficult to achieve an optimal solution with traditional optimization approaches.In this paper, a new kind of evolutionary algorithm named Population-Based Incremental Learning (PBIL) is used to solve FJSP.Some improvements are made to the basic binary PBIL algorithm.The results of the emulation have shown that the proposed algorithm is a feasible and effective approach for the FJSP.

关键词： Job-Shop Problem Flezible Job-Shop Problem PBIL

作者: Li Yu Bingyao Jin Yinghua Ni

作者单位: Xinzhi College of Zhejiang Normal University,Jinhua 321004,P.R.China Zhejiang Normal University,Jinhua 321004,P.R.China

会议类型: 国际会议

会议名称: 2009 International Symposium on Computer Science and Technology(2009 中国宁波国际计算机科学与技术学术大会)

会议地点: 宁波

会议语种:英文

页码: 551-554

在线出版日期: 2009-11-20（万方平台首次上网日期，不代表论文的发表时间）