基于三阶段解码机制的作业车间 JIT 调度算法研究

摘要

Some parts of large and complex products are very complicated in manufacturing since they have many operations to go through and are time-consuming .The just-in-time ( JIT ) scheduling is suitable to lean control these manufacturing process .In order to cope with the time consuming problem , the two-stage strategies were employed to solve JIT scheduling problem in most researches .A novel genetic algorithm ( GA) with three-stage decoding mechanism is introduced in this research .In each iteration process of GA, the chromosomes, which are represented by an operation-based scheme, are decoded successively by three stages.Firstly, the semi-active decoding method is induced to explore the more search space of solu-tions .Secondly , the greedy insertion for tardy operations is executed to swap the tardy operations left to the machine idle time to reduce the tardiness costs of solution .Thirdly, the greedy insertion for early opera-tions is proposed to swap the early operations rightly to the suitable machine idle time to cut the more earli-ness costs .The experimental results finally demonstrate the effectiveness and efficiency of our algorithm o-ver a wide range of benchmarks .%零部件加工过程的精细化管控是保证大型复杂装备制造企业高效、均衡和低成本运营的重要手段。针对现有JIT调度方法普遍采用两阶段求解策略导致调度算法计算效率较低的问题，本文提出一种单阶段的改进型遗传算法解决思路：针对每一迭代优化过程中的染色体，设计了一种包含半主动解码、拖期工件贪婪插入、提前工件贪婪插入的三阶段渐进式解码机制，以引导待调度工序集尽可能在各自的交货时间点准时完工。这种三阶段解码方法具有与非正规调度指标吻合、解码机制简单和解码速度快等独特优势，最后采用72个JIT调度标准算例验证了该方法在优化性能、计算效率等方面的有效性。