Flexible job shop scheduling problems by a hybrid artificial bee colony algorithm


In this paper, an effective artificial bee colony (ABC) algorithm is proposed for solving the flexible job shop scheduling problems. The total flow time criterion was considered. In the proposed algorithm, tabu search (TS) heuristic is introduced to perform local search for employed bee, onlookers, and scout bees. Meanwhile, an external Pareto archive set… (More)
DOI: 10.1109/CEC.2011.5949601


3 Figures and Tables