Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems

Taha Keshavarz and Nasser Salmasi

European Journal of Industrial Engineering, 2014, vol. 8, issue 3, 366-387

Abstract: In this research, a permutation flowshop sequence-dependent group scheduling problem with minimisation of total completion time is considered. Since the problem is shown to be strongly NP-hard, a hybrid genetic (HG) algorithm is proposed. The only available lower bounding (LB) method for the proposed research problem in the literature based on branch and price (B%P) algorithm is also enhanced by proposing efficient method to solve sub-problems and proposing a better branching rule. A statistical comparison shows that both the proposed HG algorithm and the proposed LB have better performance than the other methods from the literature with an average 5.96% percentage gap. [Received 13 December 2011; Revised 24 May 2012; Revised 15 November 2012; Accepted 16 November 2012]

Keywords: flowshop scheduling; group scheduling; sequence-dependent setup times; branch and price; lower bound; metaheuristics; upper bound; hybrid genetic algorithms. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.inderscience.com/link.php?id=60997 (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:eujine:v:8:y:2014:i:3:p:366-387

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().