Abstract: Wire and cable production scheduling optimization problem widely exists in actual industry,which is essentially a flexible job-shop scheduling problem with setup time and complicated resource constraints.To solve the problem,a Discrete Jaya algorithm(DJaya)was proposed by establishing a mathematical model with the objective of minimizing makespan.In DJaya,a single operation sequence was used to represent solutions and a left-shift based decoding scheme was proposed to generate schedules.The precedence operation crossover strategy and the opposition-based learning method were embedded into DJaya scheme to search the solution space more efficiently.By using the data set derived from practical production,the computational results and comparison demonstrated the high effectiveness and stability of the proposed discrete Jaya algorithm in solving the wire and cable production scheduling problem.

Key words: 线缆生产, Jaya算法, 调度优化, 最小化最大完工时间

摘要： 线缆生产调度优化问题广泛存在于电线电缆行业的生产实际中,本质上属于带安装时间和复杂资源约束的柔性作业车间调度问题。针对线缆生产调度优化问题,建立了以最小化最大完工时间为目标的问题数学模型,提出一种离散Jaya算法解决该问题。在Jaya算法框架下,基于单列编码方式和左移解码策略,融入优先工序交叉算子和反向学习搜索策略,引导算法更有效地搜索问题空间,以提升算法性能,从而实现最大完工时间最小化。基于企业生产实际生成的实例集,通过仿真实验与对比分析,表明了所提算法在求解线缆生产调度问题中具备较高的有效性和稳定性。

关键词: 线缆生产, Jaya算法, 调度优化, 最小化最大完工时间