Title of article
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
Author/Authors
Khorasanian ، Danial نويسنده is an M.S. Student of Department of Industrial Engineering, Isfahan, Iran , , Moslehi ، Ghasem نويسنده is a Professor of Department of Industrial Engineering,Isfahan, Iran ,
Issue Information
فصلنامه با شماره پیاپی 0 سال 2012
Pages
8
From page
301
To page
308
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
Journal title
International Journal of Industrial Engineering and Production Research
Serial Year
2012
Journal title
International Journal of Industrial Engineering and Production Research
Record number
682690
Link To Document