جلد 23، شماره 4 - ( 8-1391 )
جلد 23 شماره 4 صفحات 308-301 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Khorasanian D, Moslehi G. An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria. IJIEPR 2012; 23 (4) :301-308
URL: http://ijiepr.iust.ac.ir/article-1-452-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-452-fa.html
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1391; 23 (4) :301-308
چکیده: (7029 مشاهده)
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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
Production Planning & Control
دریافت: 1391/4/12 | پذیرش: 1393/4/30 | انتشار: 1393/4/30
دریافت: 1391/4/12 | پذیرش: 1393/4/30 | انتشار: 1393/4/30
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
