Basic Concept of Implementing Artificial Bee Colony (ABC) System in Flow Shop Scheduling

Abstract

Flow shop scheduling is a common operational problem in a production system. Effective flow shop scheduling can help the company to improve the management system, hence increase income. Artificial Bee Colony (ABC) is a system that is widely used for scheduling optimization in a production system since 2005. However, the fundamental ABC system uses a heuristic approach to obtain an optimum solution which may not be the optimum solution at all. The ABC system is tested on the speed to obtain the optimum solution for a flowshop scheduling problem and measures the applicability of the schedule in terms of makespan. A simple model of ABC algorithm was developed to identify the effectiveness of the ABC for solving flow shop scheduling problem compared to other established methods. Result shows the ABC model is capable of producing best makespan in flow shop problem tested.

Manipulating the Onlooker Bee’s Behaviour in Artificial Bee Colony Algorithm for Permutation Flowshop Scheduling

“…Other reports introduced a Pareto-based ABC algorithm to investigate multi-objective flexible job-shop scheduling problems, ABC clustering model in protein-protein interaction networks based on a propagating mechanism, a feature selection technique based on ABC for image steganalysis problems and the utilization of ABC to design the intelligent PID/PIλDμ speed controller for chopper fed DC motor drive [14]- [18]. A paper also reported a straightforward application of the ABC algorithm to solve PFSP, and it also compares the ABC performance against the conventional dispatch rules [19]. The ABC was also used for optimizing total tardiness in the no-idle permutation flowshop scheduling problem [20] and applied in constrained optimization problems [21].…”

An Improved Discrete Artificial Bee Colony Algorithm for Flexible Flowshop Scheduling with Step Deteriorating Jobs and Sequence-Dependent Setup Times

“…It has been applied to solve some shop scheduling problems. Chow et al [23] used this algorithm to solve the flowshop makespan problem. Li and Ma [24] presented a novel discrete ABC (DABC) algorithm for the permutation flowshop scheduling with sequencedependent setup times in order to minimize makespan and total flowtime.…”