توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱An Elitism Evolutionary Algorithm For Solving Open Shop Problem
اطلاعات انتشار: اولین کنفرانس بین المللی دستاوردهای نوین پژوهشی در مهندسی برق و کامپیوتر، سال
تعداد صفحات: ۵
In scheduling problems, we have a limited number of resources that should be allocated to some activities during a time interval. Open–shop scheduling is a kind of scheduling that is categorized as difficult problems. In this paper, we try to solve the open–shop problem by a parallel genetic algorithm. This algorithm uses several auxiliary genetic algorithms in parallel to raise the ability of the main genetic algorithm at convergence time and search more points of the problem space. Finally, this algorithm is tested on some standard problems in this field and acceptable results are presented.<\div>
نمایش نتایج ۱ تا ۱ از میان ۱ نتیجه