Purpose
The purpose of this paper is to minimize the mean flow time in open shop scheduling problem (OSSP). The scheduling problems consist of n jobs and m machines, in which each job has O operations. The processing time for 50 OSSP was generated using a linear congruential random number.
Design/methodology/approach
Different evolutionary algorithms are used to minimize the mean flow time of OSSP. This research study used simulated annealing (SA), Discrete Firefly Algorithm and a Hybrid Firefly Algorithm with SA. These methods are referred as A1, A2 and A3, respectively.
Findings
A comparison of the results obtained from the three methods shows that the Hybrid Firefly Algorithm with SA (A3) gives the best mean flow time for 76 percent instances. Also, it has been observed that as the number of jobs increases, the chances of getting better results also increased. Among the first 25 problems (i.e. job ranging from 3 to 7), A3 gave the best results for 13 instances, i.e., for 52 percent of the first 25 instances. While for the last 25 problems (i.e. Job ranging from 8 to 12), A3 gave the best results for all 25 instances, i.e. for 100 percent of the problems.
Originality/value
From the literature it has been observed that no researchers have attempted to solve OOSPs using Firefly Algorithm (FA). In this research work an attempt has been made to apply the FA and its hybridization to solve OSSP. Also the research work carried out in this paper can also be applied for a real-time Industrial problem.
AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
