Loading...

Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times

Behjat, S ; Sharif University of Technology | 2017

423 Viewed
  1. Type of Document: Article
  2. DOI: 10.1504/EJIE.2017.081418
  3. Publisher: Inderscience Enterprises Ltd , 2017
  4. Abstract:
  5. In this research, the no-wait flowshop sequence dependent group scheduling problem with minimisation of total completion time, noted as Fm|nwt, fmls, Splk|∑Cj is approached. A mixed integer linear mathematical model is proposed for the research problem. Due to the NP-hard nature of the proposed problem, several metaheuristic algorithms based on particle swarm optimisation and variable neighbourhood search with different neighbourhood search structures are proposed to heuristically solve the problem. Also, an efficient heuristic algorithm is proposed to generate the initial feasible solutions for the proposed algorithms. The performances of the proposed algorithms are compared with each other and the best available one in the literature by using available test problems in the literature. Based on the results, the proposed metaheuristics with structure oriented initial solutions have a better performance than the algorithms with random-generated initial solutions
  6. Keywords:
  7. Group scheduling ; Metaheuristics ; Minimisation of total completion time ; No-wait flowshop ; Sequence dependent setup time ; Heuristic algorithms ; Mathematical programming ; Optimization ; Particle swarm optimization (PSO) ; Scheduling ; Meta heuristics ; Sequence-dependent setup time ; Total completion time ; Problem solving
  8. Source: European Journal of Industrial Engineering ; Volume 11, Issue 1 , 2017 , Pages 22-48 ; 17515254 (ISSN)
  9. URL: https://www.inderscienceonline.com/doi/abs/10.1504/EJIE.2017.081418