考虑序列相关准备时间的分布式柔性作业车间调度研究

    Distributed Flexible Job Shop Scheduling with Sequence-Dependent Setup Times

    • 摘要: 针对考虑序列相关准备时间的分布式柔性作业车间调度问题,提出以最小化最大完工时间为优化目标的混合整数线性规划模型,并提出一种改进遗传算法。采用基于负荷均衡的种群初始化方法提高初始种群质量,根据问题特性构造6个局部扰动算子,设计多重局部扰动策略提高算法的局部搜索能力。通过扩展柔性作业车间调度基准生成测试算例,使用正交实验确定算法参数。实验结果表明,所提改进策略能够有效提高算法性能,求解结果优于对比算法,验证了调度模型和所提算法的可行性和有效性。

       

      Abstract: For the distributed flexible job shop scheduling problem considering sequence-dependent setup times, a mixed-integer linear programming model with the optimization objective of minimizing the makespan is proposed. Also, an improved genetic algorithm is developed. A load-balanced population initialization method is used to improve the quality of the initial population. Six local perturbation operators are constructed according to problem characteristics, and a multiple local perturbation strategy is designed to improve the local search capability of the algorithm. Test cases are generated by extending the flexible job shop scheduling benchmark, and the algorithm parameters are determined by orthogonal experiments. Experimental results show that the proposed strategy can effectively improve the performance of the algorithm, with solutions superior to those obtained by the comparison algorithms, thus verifying the feasibility and effectiveness of the scheduling model and the proposed algorithm.

       

    /

    返回文章
    返回