关键词: 并行多机, 并行遗传算法, 提前/拖后, 调度问题, 不同交货期窗口

Abstract: In order to solve non-identical parallel machine earliness/tardiness scheduling problem with different due windows, a hybrid genetic algorithm based on sectional coding is suggested. The coding method, on one hand, can effectively reflect the virtual scheduling policy, which can vividly reflect the distributed sequences of these produced jobs from every machine every day. On the other hand, a heuristic algorithm with combining priority rule with best-fit rule is adopted to adjust its local solutions to speed its convergence. Considering the requirements of adapting it to this kind of lager scale problem and real-time scheduling, it is parallelly implemented under the mode of master-slave control networks. The computational results show that it is efficient, and is advantageous over common genetic algorithms, and has much better parallel characteristics, and is fit for larger scale non-identical parallel machine earliness/tardiness scheduling problem with different due windows.

Key words: Parallel machine, parallel genetic algorithm, earliness/tardiness, scheduling problem, different due windows