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.