An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
Publish place: 08th International Industrial Engineering Conference
Publish Year: 1391
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,497
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC08_242
تاریخ نمایه سازی: 7 آذر 1391
Abstract:
In this paper, we propose an iterated greedy algorithm for solving the blocking Dow shop scheduling problem with total Dow time minimization objective. The steps of thisalgorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic bymodifying the best known NEH algorithm. Effectiveness of theproposed iterated greedy algorithm is tested on the Taillard's instances. Computational results show the high efficiency of thisalgorithm with comparison state-of-the-art algorithms. We report new best solutions for 88 instances of 120 Taillard's instances.
Authors
Danial Khorasanian
Isfahan University of Technology