Skip to Main Content
Hybrid flowshop scheduling problems are generalization of flowshops with parallel machines in some stages. Hybrid flowshop scheduling problems are known to be NP-hard. Hence researchers attempted to propose many heuristics and meta-heuristic algorithms to tackle such challenging tasks. In this paper, a recently developed discrete firefly algorithm is extended to solve the hybrid flowshop scheduling problems with two objectives. Makespan and mean flow time are the objective functions considered. Computational experiments are carried out to evaluate the performance of the proposed algorithm. The results show that the proposed algorithm outperforms many other meta-heuristics in the literature.