Minimising the makespan in open shop scheduling problems using variants of discrete firefly algorithm

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.