Combinatorial artificial bee colony algorithm hybridised with a new release of iterated local search for job shop scheduling problem Online publication date: Wed, 31-Aug-2022
by Amaria Ouis Khedim; Mehdi Souier; Zaki Sari
International Journal of Operational Research (IJOR), Vol. 44, No. 4, 2022
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook