期刊
KNOWLEDGE-BASED SYSTEMS
卷 243, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.knosys.2022.108471
关键词
Distributed assembly; Flow-shop scheduling problem; Total tardiness; Water wave optimization; Problem-specific knowledge
资金
- National Natural Science Foundation of China [62063021]
- Key talent project of Gansu Province [ZZ2021G50700016]
- Key Research Programs of Science and Technology Commission Foundation of Gansu Province [21YF5WA086]
- Lanzhou Science Bureau project [2018-rc-98]
- Project of Gansu Natural Science Foundation [21JR7RA204]
The study focuses on the distributed assembly blocking flow-shop scheduling problem (DABFSP) and introduces a mixed integer linear programming method and two optimization algorithms (KBNEH and KWWO). Experimental results based on 900 small-scale and 810 large-scale benchmark instances show that the performance of the KWWO algorithm is 1 to 4 times better than other comparison algorithms.
The distributed assembly blocking flow-shop scheduling problem (DABFSP), which is a promising area in modern supply chains and manufacturing systems, has attracted great attention from researchers and practitioners. However, minimizing the total tardiness in DABFSP has not captured much attention so far. For solving the DABFSP with the total tardiness criterion, a mixed integer linear programming method is utilized to model the problem, wherein the total tardiness during the production process and assembly process are optimized simultaneously. A constructive heuristic (KBNEH) and a water wave optimization algorithm with problem-specific knowledge (KWWO) are presented. KBNEH is designed by combining a new dispatching rule with an insertion-based improvement procedure to obtain solutions with high quality. In KWWO, effective technologies, such as the re-developed destruction-construction operator, four local search methods under the framework of the variable neighborhood search strategy (VNS), the path-relinking method are applied to improve the performance of the algorithm. Comprehensive numerical experiments based on 900 small-scale benchmark instances and 810 large-scale benchmark instances are conducted to evaluate the performance of the presented algorithm. The experimental results obtained by KWWO are 1 to 4 times better than those obtained by the other comparison algorithms, which demonstrate that the effectiveness of KWWO is superior to the compared state-of-the-art algorithms for the considered problem. (C) 2022 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据