东北大学主页平台徐建有--中文主页-- A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan

徐建有

访问量：

开通时间：..

最后更新时间：..

扫描访问手机版

当前位置：中文主页 >> 科学研究 >> 论文成果

A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan

点击次数：

第一作者：Jianyou Xu

合写作者：Yunqiang Yin, T.C.E. Cheng, Chin-Chia Wu, Shusheng Gu

发表刊物：Applied Soft Computing

卷号：24

影响因子：2.81

论文类型：SCI检索

备注：Q1

是否译文：否

上一条：Some due date determination scheduling problems with two agents on a single machine

下一条：An Improved Memetic Algorithm based on a Dynamic Neighbourhood for the Permutation Flowshop Scheduling Problem