An improvement heuristic for permutation flow shop scheduling

Kewal Krishan Nailwal, Deepak Gupta, Kawal Jeet and Sameer Sharma

International Journal of Process Management and Benchmarking, 2019, vol. 9, issue 1, 124-148

Abstract: An improvement heuristic algorithm is proposed in this paper for solving flow shop scheduling problem (F_m / prmu / C_max). To test its efficiency, firstly the performance of the proposed algorithm is done against the six heuristics existing in the literature including the best NEH heuristic on 120 Taillard benchmarks. Further, this set of 120 Taillard instances is increased to 266 benchmark problem instances which include Carlier's, some Reeves and some new hard VRF instances from Vallada et al. (2015). On these instances, the performance of the proposed algorithm is tested against the best NEH and the famous CDS heuristic with the best known upper bounds. Further, a brief analysis of the other heuristics and metaheuristics existing in literature is done on Taillard problem instances. The proposed heuristic outperforms all the heuristics reported in this paper.

Keywords: flow shop scheduling; makespan; heuristic; algorithm. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=97823 (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:ijpmbe:v:9:y:2019:i:1:p:124-148

Access Statistics for this article

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