A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down

M.K. Marichelvam and M. Geetha

International Journal of Enterprise Network Management, 2019, vol. 10, issue 2, 162-175

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.

Keywords: scheduling; NP-hard; flow shop; makespan; firefly algorithm; variable neighbourhood search; VNS. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=100544 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijenma:v:10:y:2019:i:2:p:162-175

Access Statistics for this article

More articles in International Journal of Enterprise Network Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().