首页 | 本学科首页   官方微博 | 高级检索  
     


A study on open shop scheduling to minimise total tardiness
Authors:B. Naderi  M. Aminnayeri  M. Zandieh
Affiliation:1. Department of Industrial Engineering , Amirkabir University of Technology , 424 Hafez Avenue, 1591634311 Tehran, Iran;2. Department of Industrial Management , Management and Accounting Faculty, Shahid Beheshti University , G.C., Tehran, Iran
Abstract:This paper deals with open shop scheduling to minimise total tardiness. Contrary to other scheduling problems (i.e., flow and job shops), the formulation of the open shop is given far less attention in the literature. Therefore, we intend to fulfil this gap by the presentation of four different mixed integer linear programming models. We compare the models on the basis of their complexity sizes. Furthermore, we propose two metaheuristics based on genetic algorithm and variable neighbourhood search. We exhaustively explore the effect of different operators and parameters on the performance of genetic algorithm by means of Taguchi method. Two computational experiments are conducted to evaluate the models and algorithms for performance. The first one includes small-sized instances by which the models and general performance of the algorithms are examined. The second one consists of three well-known benchmarks by which we further evaluate the algorithms. The results show the effectiveness of the proposed models and algorithms.
Keywords:scheduling  open shop  mathematical model  mixed integer linear programming  genetic algorithm  variable neighbourhood search  Taguchi method  total tardiness
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号