An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 23، Issue: 4
Publish Year: 1391
نوع سند: مقاله ژورنالی
زبان: English
View: 667
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-23-4_008
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is tested on the Taillard's instances. Computational results show the high efficiency of this algorithm with comparison state-of-the-art algorithms. We report new best solutions for 88 instances of 120 Taillard's instances.
Authors
D. Khorasanian
is an M.S. Student of Department of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran
G. Moslehi
is a Professor of Department of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran