|
|
|
|
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
|
|
|
|
|
|
|
|
نویسنده
|
Khorasanian D. ,Moslehi G.
|
|
منبع
|
international journal of industrial engineering and production research - 2012 - دوره : 23 - شماره : 4 - صفحه:301 -308
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Constructive heuristic ,Iterated greedy algorithm ,Blocking flow shop ,Total flow time
|
|
آدرس
|
isfahan university of technology, Department of Industrial Engineering, ایران, isfahan university of technology, Department of Industrial Engineering, ایران
|
|
پست الکترونیکی
|
moslehi@cc.iut.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|