Hybrid Genetic Algorithm for Flexible Job Shop Scheduling with Overlapping in Operations

摘要：

Flexible job shop scheduling problem(FJSP)is an extension of the classical job shop scheduling problem which allows an operation to be processed by any maine from a given set．FJSP iS NP-hard and mainly presents two difficulties．The first one is to assign each operation to a machine out of a set of capable machines,and the second one deals with sequencing the assigned operations on the machines． However,it iS quite difficult to achieve an optimal solution to this problem in medium and large size problems with traditional optimization approaches．In this paper a memetic algorithm(MA)for flexible job shop scheduling with overlapping in operation is proposed that solves the FJSP to minimize makespan time．The experimental results show that the proposed algorithm is capable to achieve the optimal solution for sinail size problems and near optimal solutions for medium and large size problems

关键词： Flexible job shop scheduling Overlapping Hybrid genetic algorithm

作者: Ali Rahimi Fard Babak Yousefi Yegane Narges Khanlarzade

作者单位: Department of Industrial Engineering Malayer Branch,Islamic Azad University,Malayer,lran Department of Industrial Engineering Malayer Branch,Islamic Azad University,Malayer,lran Department of Industrial Engineering Tarbiat Modares University Tehran,Iran

会议类型: 国际会议

会议名称: 2011 International Conference on Manufacturing and Industrial Engineering(ICMIE 2011)(2011年制造及工业工程国际会议)

会议地点: 海口

会议语种:英文

页码: 35-39

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