自动化学报Issue(3)：548-555,8.DOI:10.3724/SP.J.1004.2014.00548
求解总拖期时间最小化流水车间调度问题的多智能体进化算法
A Multi-agent Evolutionary Algorithm for Solving Total Tardiness Permutation Flow-shop Scheduling Problem
摘要
Abstract
In this research, we propose a multi-agent evolution-ary algorithm for the permutation flow-shop scheduling problem (PFSP) considering the total tardiness minimization criterion. The algorithm includes the tardiness rank based learning scheme to generate high quality solution by using the specific knowledge of the related problem. We also develop and integrate the prob-ability acceptance model into the proposed algorithm to evolve the whole agent lattice network. A complete calibration of the different parameters of the proposed algorithm by means of a design of experiment approach is given. Using the 540 bench-mark problems, a comparative evaluation with other heuristic methods in the literature have been carried out. The results show that the proposed algorithm is effective and competitive.关键词
流水车间调度/总拖期时间/多智能体/进化算法Key words
Permutation flow-shop scheduling problem (PFSP)/total tardiness/multi-agent/evolutionary algorithm引用本文复制引用
王大志,刘士新,郭希旺..求解总拖期时间最小化流水车间调度问题的多智能体进化算法[J].自动化学报,2014,(3):548-555,8.基金项目
国家自然科学基金(61333006,71171038),中央高校基本科研业务费(N110404024)资助Supported by National Natural Science Foundation of China (61333006,71171038), the Fundamental Research Funds for the Cen-tral Universities (N110404024) （61333006,71171038）
