论文部分内容阅读
讨论了一种解决柔性作业车间调度问题(FJSSP)的改进遗传算法,在FJSSP中考虑有一个具有n个工件和m台机器的生产线,每道工序在不同的机器上完成且有各自的加工时间.FJSSP是作业车间调度问题(JSSP)的延伸,在FJSSP中每道工序的可选择加工的机器可能不止一台.FJSSP的目标是在所有工件的工序在m台机器上加工且不冲突的前提下找到一个最短的总调度时间.通过使用改进的遗传算法来搜索FJSSP的最优方案.并通过使用Brandimarte设计的10组不同规格的测试用例来测试算法的性能.实验结果表明,实验的运行结果满足了调度要求,进一步证明了本改进遗传算法在解决FJSSP方面的有效性和实用性.
An improved genetic algorithm to solve the problem of flexible job shop scheduling (FJSSP) is discussed. In FJSSP, a production line with n workpieces and m machines is considered. Each process is performed on different machines and has its own processing time FJSSP is an extension of the Job Shop Scheduling Problem (JSSP) and there may be more than one machine that can be optionally machined per process in the FJSSP. The goal of FJSSP is to treat all workpieces on m machines without conflict To find a shortest total scheduling time.The optimal algorithm of FJSSP was searched by using improved genetic algorithm.The performance of the algorithm was tested by using 10 different test cases designed by Brandimarte.Experimental results showed that the experimental results Which satisfies the scheduling requirements and further proves the validity and practicability of the improved genetic algorithm in solving FJSSP.