文献类型：期刊文献

英文题名：Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion

作者：Zhang, Guanghui Xing, Keyi

第一作者：Zhang, Guanghui;张广辉

通信作者：Xing, KY[1];Xing, KY[2]

机构：[1]Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China;[2]Xi An Jiao Tong Univ, Syst Engn Inst, Xian 710049, Shaanxi, Peoples R China;[3]Guizhou Inst Technol, Sch Sci, Guiyang 550003, Guizhou, Peoples R China

第一机构：Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China

通信机构：corresponding author), Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China;corresponding author), Xi An Jiao Tong Univ, Syst Engn Inst, Xian 710049, Shaanxi, Peoples R China.

年份：2019

卷号：108

起止页码：33-43

外文期刊名：COMPUTERS & OPERATIONS RESEARCH

收录：;EI(收录号：20191406738307);Scopus(收录号：2-s2.0-85063770551);WOS:【SCI-EXPANDED(收录号:WOS:000471733300003)】；

语种：英文

外文关键词：Distributed flowshop scheduling; Makespan minimization; Limited buffers; Differential evolution metaheuristics

摘要：This paper addresses the distributed limited-buffer flowshop scheduling problem with makespan minimization criterion for the first time. The manufacturing layout consists of multiple homogeneous factories and each one is set as a permutation flowshop with limited buffers between any two adjacent machines. Compared with traditional single shop scheduling, this problem is more realistic because of the distribution and limited buffer constraints. Given that the NP-hardness, this paper focuses on the approximate approaches, and successively proposes two constructive heuristics for generating fast schedule and providing good initialization of meta-heuristics, a differential evolution algorithm run in continuous search space to further better the so-obtained schedules, and a discrete differential evolution algorithm implemented directly in combinatorial search space. Extensive experimental results validate that the performance of discrete differential evolution perform the best and other algorithms proposed in this paper are all with satisfactory evaluations. (C) 2019 Elsevier Ltd. All rights reserved.