A discrete artificial bee colony algorithm for the blocking flow shop scheduling problem

Abstract

This paper presents a discrete bee colony algorithm for solving the blocking flow shop scheduling problem with makespan criterion. Based on the idea of iterated greedy algorithm, some new schemes for employed bee, onlooker bee and scout bee are designed. The performance of the proposed algorithm is tested on the well-known benchmark set of Taillard, and the computational results validate the effectiveness of the discrete bee colony algorithm in comparison with two recently proposed state-of-the-art algorithms. In addition, some new best known solutions for the benchmark set are provided for the considered problem. Index Terms -Flow shop scheduling, blocking, artificial bee colony algorithm, makespan

A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

“…In the mutation part, the bestrandinsert operation [30] is introduced. The procedure of the bestrandinsert is described as follows.…”

An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems

“…Nevertheless, on account of its continuous nature, the studies on ABC algorithm for production scheduling problems are still in their infancy. In the latest study, some researchers have successfully applied ABC-based algorithm to a series of scheduling problems, such as permutation flow shop scheduling problem [30], blocking flow shop scheduling problem [31,32], lot-streaming flow shop scheduling problem [33,34], multiobjective flexible job shop scheduling problem [35], and steelmaking process scheduling problem [36].…”