Solving hybrid flow shop scheduling problems using bat algorithm. (1st January 2013)

• Record Type: Journal Article
• Authors: Marichelvam, M.K.; Prabaharan, T.; Yang, Xin-She; Geetha, M.
• Is Part Of: International journal of logistics, economics and globalisation. Volume 5:Number 1(2013)
• Page Start: 15
• Page End: 29
• Publication Date: 2013-01-01
• Subjects: hybrid flow shop -- HFS -- scheduling -- NP-hard -- bat algorithm -- makespan; Logistics -- Periodicals; Logistics -- Economic aspects -- Periodicals; Globalization -- Periodicals; 658.505
• Languages: English
• ISSNs: 1741-5373

Abstract

This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed bat meta-heuristic algorithm is proposed to solve the HFS problems. The proposed algorithm is validated with a well-chosen set of benchmark problems in the literature. Computational results indicate that the proposed bat algorithm is more efficient than the genetic algorithm and particle swarm optimisation.