The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery | |
Yang SL(杨圣落)1,2,3; Xu ZG(徐志刚)1,2 | |
刊名 | International Journal of Production Research
![]() |
2021 | |
卷号 | 59期号:13页码:4053-4071 |
关键词 | scheduling distributed assembly flowshop variable neighbourhood descent iterated greedy batch delivery flexible assembly |
ISSN号 | 0020-7543 |
产权排序 | 1 |
英文摘要 | The scheduling problems of distributed production have received increasing attention in recent years. To coordinate the scheduling of production and transportation, we propose a novel distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery (DAPFSP-FABD). The objective is to minimise the total cost of delivery and tardiness. Given that the problem involves six successive decisions, several batch allocation strategies for both production and distribution are proposed, and four neighbourhood structures are designed to search for the best batch sequence, batch allocation, product sequence, and job sequence. Seven algorithms, including four heuristics, a variable neighbourhood descent (VND) algorithm, and two iterated greedy (IG) algorithms, are proposed. In the IG, two types of destruction and construction operations are present to facilitate escape from local optima, thereby resulting in two IG algorithms: IG_desP and IG_desJ. Finally, extensive computational and statistical experiments are carried out. The results show that the proposed batch allocation strategies can improve the solution significantly. Additionally, the heuristics can obtain reasonable solutions in a short time, while IG_desJ performs the best regarding the quality of solutions. This study can help cross-regional companies coordinate the scheduling of production and transportation and enhance the performance of supply chains. |
资助项目 | Science and Technology Foundation from the Science and Technology Bureau of Shenyang[Z17-7-002] |
WOS关键词 | ITERATED GREEDY ALGORITHM ; SUPPLY CHAIN ; INTEGRATED PRODUCTION ; MINIMIZING MAKESPAN ; MULTIPLE CUSTOMERS ; TOTAL FLOWTIME ; SHOP ; HEURISTICS ; TARDINESS ; TRANSPORTATION |
WOS研究方向 | Engineering ; Operations Research & Management Science |
语种 | 英语 |
WOS记录号 | WOS:000532233200001 |
资助机构 | Science and Technology Foundation from the Science and Technology Bureau of Shenyang under Project No. Z17-7-002. |
内容类型 | 期刊论文 |
源URL | [http://ir.sia.cn/handle/173321/26830] ![]() |
专题 | 沈阳自动化研究所_装备制造技术研究室 |
通讯作者 | Yang SL(杨圣落) |
作者单位 | 1.Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang, China 2.Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, China 3.University of Chinese Academy of Sciences, Beijing, China |
推荐引用方式 GB/T 7714 | Yang SL,Xu ZG. The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery[J]. International Journal of Production Research,2021,59(13):4053-4071. |
APA | Yang SL,&Xu ZG.(2021).The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery.International Journal of Production Research,59(13),4053-4071. |
MLA | Yang SL,et al."The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery".International Journal of Production Research 59.13(2021):4053-4071. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论