Loading...

Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs

Varmazyar, M ; Sharif University of Technology | 2012

727 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/00207543.2011.632385
  3. Publisher: 2012
  4. Abstract:
  5. Flow shop scheduling problems with sequence-dependent setup times and minimising the number of tardy jobs as the criterion (F m |prmu, S ijk |∑U j) are considered in this research. A mixed-integer linear programming model is developed for the research problem. Since the proposed research problem has been proven to be NP-hard, several meta-heuristic algorithms based on tabu search (TS) and the imperialist competitive algorithm (ICA) are proposed to heuristically solve the problem. In order to find the best meta-heuristic algorithm, random test problems, ranging in size from small, medium, to large, are generated and solved by the meta-heuristic algorithms. Then, a detailed statistical experiment based on the split-plot design is performed to find the best meta-heuristic algorithm. The results of the experiment show that the performance of ICA is worse than the other algorithms for small- and medium-sized problems. The hybrid of ICA and the TS algorithm provides better performance than the other proposed algorithms for large-sized problems
  6. Keywords:
  7. Flow shop ; Mathematical modelling ; Minimising the number of tardy jobs ; Competitive algorithms ; Flow shop scheduling problem ; Flow-shops ; Imperialist competitive ; Meta heuristic algorithm ; Mixed integer linear programming ; NP-hard ; Number of tardy jobs ; Random tests ; Research problems ; Sequence-dependent ; Sequence-dependent setup time ; Split-plot design ; Statistical experiments ; Experiments ; Heuristic algorithms ; Machine shop practice ; Mathematical models ; Scheduling ; Tabu search ; Problem solving
  8. Source: International Journal of Production Research ; Volume 50, Issue 20 , 2012 , Pages 5843-5858 ; 00207543 (ISSN)
  9. URL: http://www.tandfonline.com/doi/abs/10.1080/00207543.2011.632385