基于混合遗传算法的Job-Shop调度问题的研究

Research on the Job-Shop scheduling based on mixed genetic algorithm

Job-Shop调度问题是最困难的组合优化问题之一,由于其固有的计算复杂性,一般无法利用经典解析算法求出最优解。结合实际生产情况,建立了Job-Shop调度问题的模型,并基于遗传算法与局部搜索启发式算法相结合的混合遗传算法的思想给出了求解此模型的算法过程。

Job-Shop Scheduling is one of the most difficult problems in the field of combinational optimization. It is usually hard to achieve the optimal solution with classical methods due to its high computational complexity. Designs the model of Job-Shop scheduling, presents the solution based on a mixed genetic algorithm combined the genetic algorithm and heuristical algorithm.