4.7 Article

An improved genetic algorithm with modified critical path-based searching for integrated process planning and scheduling problem considering automated guided vehicle transportation task

期刊

JOURNAL OF MANUFACTURING SYSTEMS
卷 70, 期 -, 页码 127-136

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2023.07.004

关键词

Integrated process planning and scheduling; (IPPS); Automated guided vehicle (AGV); Encoding method; Genetic algorithm; Critical path

向作者/读者索取更多资源

Integrated process planning and scheduling (IPPS) can improve the whole performance of the manufacturing system by taking advantage of process planning and shop scheduling. Additional consideration of the shop logistics system including AGV task assignment can further enhance shop productivity and system efficiency. This paper proposes an integrated encoding method and an improved genetic algorithm (IGA) to solve the IPPS problem considering AGV transportation task (IPPS_T), and the numerical experiments confirm the effectiveness of the proposed method and strategy.
Integrated process planning and scheduling (IPPS) can take advantage of the complementary attributes of process planning and shop scheduling to obtain better production schemes and process routes improving the whole performance of the manufacturing system. Additional consideration of the shop logistics system including task assignment of automated guided vehicles (AGVs) can improve shop productivity while ensuring the smooth running of the whole manufacturing system. This paper investigates an IPPS problem considering AGV transportation task (IPPS_T). Compared with the original IPPS, IPPS_T addresses not only the process selection, operation sequencing, and machine selection but also the transportation task assignment of the AGVs. Therefore, it is much more difficult than the IPPS problem which has already been proven to be NP-hard. The paper proposes an integrated encoding method to improve the integration of the manufacturing system by representing the process route, shop scheduling scheme, and transportation task assignment plan simultaneously in one individual. This paper designs an improved genetic algorithm (IGA) combining a critical path-based neighborhood searching strategy which can ensure the effectiveness of local search on both AGVs and machines. The numerical experiments with different numbers of AGVs are conducted on the open instances which are extended from the well-known Kim benchmark. The results obtained by the IGA show significant advantages proving the effectiveness of the proposed encoding method and critical path-searching strategy.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据