Loading...

Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem

Keshavarz, T ; Sharif University of Technology | 2013

574 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/00207543.2013.825055
  3. Publisher: 2013
  4. Abstract:
  5. In this research, the flexible flowshop sequence-dependent group scheduling problem with minimisation of makespan as the criterion (FFm|fmls, shgi|Cmax) is investigated. A mixed integer linear mathematical model for the research problem is developed. Since the research problem is shown to be NP-hard, a meta-heuristic algorithm based on memetic algorithm (MA) is developed to efficiently solve the problem. Also, a lower bounding technique based on the developed mathematical model is proposed to evaluate the quality of the proposed MA. The performance of the proposed MA is compared with the existing algorithm in the literature, i.e. tabu search (TS), by solving the available test problems in the literature. A comparison based on paired t-test shows that the average makespan of the proposed MA is 3% lower than the average makespan of the TS. The average percentage gap of MA for small-size problems comparing with the optimal solution is 0.8%. Also, the average percentage gap of the proposed MA compared to the proposed lower bound for medium-size test problems (problems up to 65 jobs in all groups) is 5%
  6. Keywords:
  7. Flexible flowshop scheduling ; Lower bound ; Memetic algorithm ; Metaheuristics ; Sequence-dependent group scheduling ; Flexible flowshop ; Group scheduling ; Lower bounds ; Memetic algorithms ; Heuristic algorithms ; Mathematical models ; Research ; Scheduling algorithms ; Problem solving ; Meta heuristics
  8. Source: International Journal of Production Research ; Volume 51, Issue 20 , 2013 , Pages 6182-6193 ; 00207543 (ISSN)
  9. URL: http://www.tandfonline.com/doi/abs/10.1080/00207543.2013.825055