Scheduling analysis for flowship using artifical bee colony (ABC) algorithm with varying onlooker approaches

Mohd Pauzi, Nur Fazlinda and Ahmad Bareduan, Salleh (2016) Scheduling analysis for flowship using artifical bee colony (ABC) algorithm with varying onlooker approaches. ARPN Journal of Engineering and Applied Sciences, 11 (10). pp. 6472-6477. ISSN 18196608

Full text not available from this repository.

Abstract

Artificial Bee Colony (ABC) algorithm is one of the methods used to solve the flowshop scheduling problem. In order to further investigate the ABC capabilities, we proposed a methodology with the capability of manipulating the onlooker bee approaches in ABC Algorithm for solving flowshop scheduling problem. This paper reviews the analysis of the performance of the ABC algorithm through three different onlooker approaches i.e. method 3+0+0 (three onlooker bees are dedicated to the best employed bee), method 2+1+0 (two onlooker bees are dedicated to the best employed bee and one onlooker bee is dedicated to second best employee bee) and method 1+1+1 (one onlooker bee is dedicated to each employed bee). The simulation results indicated that method 2+1+0 produces best result at low iterations of 102 and below. At high iterations of 204 and above method 3+0+0 dominates the best performance.

Item Type:Article
Uncontrolled Keywords:Artificial bee colony algorithm; flowshop scheduling problem; onlooker bee; employee bee; makespan
Subjects:T Technology > TS Manufactures > TS155-194 Production management. Operations management
Divisions:Faculty of Mechanical and Manufacturing Engineering > Department of Manufacturing and Industrial Engineering
ID Code:8708
Deposited By:Mr. Mohammad Shaifulrip Ithnin
Deposited On:13 Aug 2018 11:26
Last Modified:13 Aug 2018 11:26

Repository Staff Only: item control page