一种改进的车间调度算法

Research on Improved Job-Shop Scheduling Algorithm

为了解决考虑生产总成本的车间调度问题,对引入加工成本、库存管理成本和拖期惩罚成本的车间调度问题进行了研究,提出了一种改进的遗传算法求解该问题。论述了改进遗传算法的编码、初始化、选择、交叉和变异操作,通过与基本遗传算法的仿真比较,验证了该算法在收敛速度和最优解值上的优越性。

In order to minimize the total cost of production, the cost of processing, inventory management and punishment caused by delay was introduced into the job - shop scheduling problem. An improved genetic algorithm is presented. The genetic operations, including encoding scheme, initial population, selection, crossover, mutation, are discussed in detail. Through the comparison with the basic genetic algorithm, the simulation results show that the improved algorithm has a fast convergence speed and a good optimal solution.