Minimising makespan in distributed assembly hybrid flowshop scheduling problems

Kuo Ching Ying, Shih Wei Lin*, Kuan Fu Chen

*此作品的通信作者

研究成果: 期刊稿件文章同行評審

摘要

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.

文獻附註

Publisher Copyright:
© 2024 Informa UK Limited, trading as Taylor & Francis Group.

指紋

深入研究「Minimising makespan in distributed assembly hybrid flowshop scheduling problems」主題。共同形成了獨特的指紋。

引用此