基于启发式算法的并行多机调度问题研究

Study of Multi - Machine Scheduling Problem Based on Heuristic Algorithm

从车间生产调度的实际情况出发,针对最小化完工时间的多机调度问题,提出了一种改进的极大消去法,并利用该算法进行了调度仿真,仿真结果表明:该改进后的算法能够更好的解决大规模多机生产调度问题。

According to the actual situation of manufacture scheduling, an improved amximum deleting algorithm for minimizing make-span in multi-machine scheduling problem is presented. The result of computer simulation shows that the improved heuristic algorithm can better solve large-scale multi-machine scheduling problem.