A Discrete Artificial Bee Colony for Distributed Permutation Flowshop Scheduling Problem with Total Flow Time Minimization
作者单位：Shengli No.1 Middle School School of Mechatronic Engineering and Automation Shanghai University Computer Center Shanghai University
会议名称：《第37届中国控制会议》
会议日期：2018年
学科分类：08[工学] 081104[工学-模式识别与智能系统] 0811[工学-控制科学与工程]
基 金：supported by the National Science Foundation of China 51575212 and 61174187 Shanghai Key Laboratory of Power station Automation Technology
关 键 词：Scheduling Flowshop Artificial Bee colony Total Flow Time
摘 要：The distributed permutation flowshop scheduling problem（DPFSP） has important applications in modern industries.This paper presents a discrete artificial bee colony（DABC） algorithm for solving the DPFSP with total flow time criterion. We use the job permutation based representation to represent the candidate solutions. The insertion operator is adapted to generate neighboring solutions in the search process. We re-design the search phases including employ bees, onlooker bees, and scout bees according to the problem-specific knowledge. A comprehensive computational campaign based on the 720 benchmark instances demonstrates the effectiveness of the proposed DABC algorithm for solving the DPFSP with the total flowtime criterion.