基于最小完工期的离散型作业车间调度问题的遗传算法设计

Genetic arithmetic designing for job shop scheduling problem with minimal makespan

针对离散型生产作业中的车间调度问题,以完工期最小为目标,设计了遗传算法,并利用PB语言编程实现该算法。最后,将该算法应用于某一钢铁公司金工车间的车间调度,并与原调度的结果做了比较,证明了本算法在实际应用中的有效性。

Aiming at Job Shop Scheduling Problem with Minimal Makespan, This paper puts emphasis on designing the encoding scheme, decoding scheme and each genetic computing element of Genetic Algorithm, and also achieves the algorithm by using the PowerBuilder programming. Finally, this paper applies Genetic Algorithm to production scheduling in a metalworking shop in a steel enterprise, compares the results with that gets from the enterprise, and testifies the validity of Genetic Algorithm used in solving Job Shop scheduling problems.