Volume 23, Number 4 (IJIEPR 2012)                   IJIEPR 2012, 23(4): 301-308 | Back to browse issues page

XML Print

Download citation:
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-en.html

Faculty , moslehi@in.iut.ac.ir
Abstract:   (2735 Views)
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.
Full-Text [PDF 434 kb]   (1742 Downloads)    
Type of Study: Research | Subject: Production Planning & Control
Received: 2012/07/2 | Accepted: 2014/07/21 | Published: 2014/07/21

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb