Title: Combinatorial artificial bee colony algorithm hybridised with a new release of iterated local search for job shop scheduling problem
Authors: Amaria Ouis Khedim; Mehdi Souier; Zaki Sari
Addresses: Manufacturing Engineering Laboratory of Tlemcen (MELT), Department of Electrical and Electronic Engineering, University of Tlemcen, PB 230, Tlemcen, 13000, Algeria ' Manufacturing Engineering Laboratory of Tlemcen (MELT), University of Tlemcen, PB 230, Tlemcen, 13000, Algeria; High School of Management of Tlemcen, PB 1085, Tlemcen, 13000, Algeria ' Manufacturing Engineering Laboratory of Tlemcen (MELT), University of Tlemcen, PB 230, Tlemcen, 13000, Algeria; Ecole Supérieure en Sciences Appliquées Tlemcen (ESSAT), PB 165, Tlemcen, 13000, Algeria
Abstract: Job shop scheduling problem (JSP) is recognised as an attractive subject in production management and combinatorial optimisation. However, it is known as one of the most difficult scheduling problems. The present paper investigates the job shop scheduling problem in order to minimise the makespan with a new hybrid combinatorial artificial bee colony algorithm. Firstly, the proposed combinatorial version integrates a position based crossover for the updating of solutions and the rank-based selection for selecting solutions to be updated in the onlooker bees phase. Another purpose of this study consists to highlight the impact of its sequential hybridisation with a new release of iterated local search method called 'simple iterated local search (SILS)'. The proposed approaches are tested on many benchmark problems taken from the Operations Research Library (OR-Library). The simulation results show that the hybrid CABC performs the best in most of the studied cases.
Keywords: job shop scheduling problem; JSP; metaheuristics; artificial bee colony algorithm; iterated local search.
International Journal of Operational Research, 2022 Vol.44 No.4, pp.435 - 461
Received: 29 Jun 2019
Accepted: 13 Oct 2019
Published online: 31 Aug 2022 *