مشاهده مشخصات مقاله
Job-Shop Scheduling Using Hybrid Shuffled Frog Leaping
|
نویسنده (ها) |
-
M. Alinia Ahandani
-
N. Pourqorban Shirjoposht
-
R. Banimahd
|
|
مربوط به کنفرانس |
چهاردهمین کنفرانس بینالمللی سالانه انجمن کامپیوتر ایران |
|
چکیده |
Job-shop scheduling problem is demonstrated as
one of the NP-complete problems. To solve this
problem, we propose two types of hybrid shuffled frog
leaping algorithm. Hybrid algorithms are generated by
combining the shuffled frog leaping and a local search
method. Also a new local search method by combining
two other simple local searches is proposed. The
obtained results demonstrate that our proposed hybrid
algorithms have a better performance than their nonhybrid
competitors. Also a comparison among
proposed hybrid shuffled frog leaping and hybrid
genetic algorithms demonstrate that the hybrid shuffled
frog leaping algorithms can be generated a better
schedule than their genetic algorithm competitors. A
caparison of the best obtained results with the results
reported in the considered literature shows that our
proposed algorithms have a comparable performance. |
|
قیمت |
-
برای اعضای سایت : ۱٠٠,٠٠٠ ریال
-
برای دانشجویان عضو انجمن : ۲٠,٠٠٠ ریال
-
برای اعضای عادی انجمن : ۴٠,٠٠٠ ریال
|
خرید مقاله
|
|
.gif){kind=icon}