Minimising makespan in distributed assembly hybrid flowshop scheduling problems
针对分布式装配混合流水车间调度问题，提出了混合整数线性规划模型和迭代ε-贪婪强化学习算法，实验表明能显著缩短最大完工时间，对多阶段车间调度研究有贡献。
To enhance the manufacturing flexibility, resilience, and production efficiency, the integration of scheduling for distributed manufacturing with assembly systems has become a pivotal driver of production planning evolution. In this research endeavour, we present a Mixed-Integer Linear Programming model and an innovative Iterated Epsilon-Greedy Reinforcement Learning algorithm to address the distributed assembly hybrid flowshop scheduling problem. Empirical validation, conducted through computational experiments on a benchmark problem set, is used to gain important managerial insights. The computational results demonstrate that the proposed algorithms significantly reduce the makespan for the addressed problem. This study has the potential to make valuable contributions to ongoing research endeavours within the realm of multi-stage shop scheduling, an area that continues to warrant progressive advancement.