التفاصيل البيبلوغرافية
| العنوان: |
Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions. |
| المؤلفون: |
FranÇa, P. M., Tin, G., Buriol, L. S. |
| المصدر: |
International Journal of Production Research; 3/1/2006, Vol. 44 Issue 5, p939-957, 19p, 3 Diagrams, 9 Charts, 2 Graphs |
| مصطلحات موضوعية: |
COMBINATORICS, MATHEMATICAL optimization, COMPUTATIONAL mathematics, PARALLEL processing, OPERATIONS research, TERNARY system, PARALLEL logic programming, HEURISTIC programming, SUPERCOMPUTERS, COMPUTER science research, RESEARCH methodology |
| مستخلص: |
This article deals with the no-wait flowshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. Embedded in the hybrid approach, a novel recursive local search scheme, recursive arc insertion (RAI), is also proposed. The effectiveness of the local search phase is crucial given that it is responsible for about 90% of the total processing time of the algorithm. Instances with known optimal solution are used to test the new algorithm and compare it to a previously proposed heuristic approach. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
PDF full text from Publisher 
Full Text Finder