Minimising the makespan in open shop scheduling problems using variants of discrete firefly algorithm Online publication date: Mon, 21-Oct-2019
by A. Hussain Lal; Vishnu K.R.; A. Noorul Haq
International Journal of Advanced Operations Management (IJAOM), Vol. 11, No. 4, 2019
Abstract: Minimising makespan in open shop scheduling problem is the aim of this research work. The scheduling problems consist of 'n' jobs and 'm' machines, in which each job has 'O' operations. The processing time for 50 open shop scheduling problems was generated using a linear congruential random number generator. A non-traditional algorithm called discrete firefly algorithm is proposed to minimise the makespan of open shop scheduling problems and this method is referred as A1. Discrete firefly algorithm is also hybridised along with other heuristic algorithms in two ways: 1) firefly algorithm is hybridised with longest total remaining processing on other machines and local search algorithms which is referred as A2; 2) firefly algorithm is hybridised with simulated annealing and referred as A3. Novelty of this work focuses on the application of open shop scheduling problems in quality control of a production industry.
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 Advanced Operations Management (IJAOM):
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