Loading...

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

Keshavarz, T ; Sharif University of Technology

497 Viewed
  1. Type of Document: Article
  2. DOI: 10.1504/EJIE.2014.060997
  3. Abstract:
  4. 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]
  5. Keywords:
  6. Integer programming ; Optimization ; Scheduling ; Branch and price ; Flow-shop scheduling ; Group scheduling ; Lower bounds ; Meta heuristics ; Sequence-dependent setup time ; Problem solving
  7. Source: European Journal of Industrial Engineering ; Vol. 8, issue. 3 , 2014 , pp. 366-387 ; ISSN: 17515254
  8. URL: http://www.inderscienceonline.com/doi/abs/10.1504/EJIE.2014.060997