A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down. (27th June 2019)

• Record Type: Journal Article
• Authors: Marichelvam, M.K.; Geetha, M.
• Is Part Of: International journal of enterprise network management. Volume 10:Number 2(2019)
• Page Start: 162
• Page End: 175
• Publication Date: 2019-06-27
• Subjects: scheduling -- NP-hard -- flow shop -- makespan -- firefly algorithm -- variable neighbourhood search -- VNS; Business logistics -- Management -- Periodicals; Business enterprises -- Management -- Periodicals; 658.7205
• Languages: English
• ISSNs: 1748-1252

Abstract

A flow shop scheduling problem with uncertain processing times and machine break down is considered in this paper. The objective is to minimise the maximum completion time (makespan). As the problem is non-deterministic polynomial-time hard (NP-hard), a hybrid algorithm (HA) is proposed to solve the problem. The firefly algorithm (FA) is hybridised with the variable neighbourhood search (VNS) algorithm in the proposed HA. Extensive computational experiments are carried out with random problem instances to validate the performance of the proposed algorithm.