A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion

作者：

Highlights：

• A novel bi-population EDA for NIFPSP.

• Suitable adjusting mechanisms for adjusting probability models.

• Insertion based local search procedure to enhance exploitation.

• Better results obtained than those by the existing meta-heuristics.

摘要

•A novel bi-population EDA for NIFPSP.•Suitable adjusting mechanisms for adjusting probability models.•Insertion based local search procedure to enhance exploitation.•Better results obtained than those by the existing meta-heuristics.

论文关键词：No-idle permutation flow-shop scheduling problem,Total tardiness,Estimation of distribution algorithm,Bi-population,Probability model

论文评审过程：Received 20 December 2013, Revised 10 September 2014, Accepted 13 November 2014, Available online 20 November 2014.

论文官网地址：https://doi.org/10.1016/j.knosys.2014.11.016