分布式装配置换流水车间调度问题研究综述

Survey on Distributed Assembly Permutation Flowshop Scheduling

近几十年来,现代制造业发展迅速,一种趋势是在分布式生产工厂进行工件的加工,待完成后到装配工厂集中装配成最终产品。该模式在带来诸多好处的同时,对资源调度提出了新的挑战。针对分布式装配置换流水车间调度问题(distributed assembly permutation flowshop scheduling problem,DAPFSP),介绍了DAPFSP的背景和存在的主要困难,进而对以最小化最大完工时间为优化目标的DAPFSP,从数学模型、编解码策略、全局和局部搜索算法角度进行探讨,分别综述了以最小化总流程时间等为优化目标,具有零等待等约束,以及考虑准备时间等因素的DAPFSP研究成果。最后,对有待进一步开展的研究工作进行展望。

As the rapid development of modern manufacturing,the past decades have witnessed a trend in which jobs are firstly processed in distributed production factories and then assembled into the final products in an assembly factory after completion.Such manufacturing mode brings many advantages as well as some new challenges on resource scheduling.This paper surveys literature on the distributed assembly permutation flowshop scheduling problem(DAPFSP).Firstly,the background and main issues in DAPFSP are introduced.Then,mathematical models,encoding and decoding schemes,and global and local search algorithms are thoroughly discussed for DAPFSP with the objective of minimizing the maximal completion time.Additionally,recent advances on DAPFSP with various objectives,such as total flow time,DAPFSP with other constraints like no-wait,and DAPFSP by taking issues including setup time into consideration are also surveyed.Finally,several future research directions worthy further investigation are pointed out.