Electromagnetism-like algorithm for permutation flowshop
Publish place: دومین کنفرانس بین المللی پژوهش در علوم و تکنولوژی
Publish Year: 1394
نوع سند: مقاله کنفرانسی
زبان: English
View: 512
This Paper With 11 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CRSTCONF02_035
تاریخ نمایه سازی: 21 شهریور 1395
Abstract:
Problem of scheduling in permutation flowshop is dealt with by minimizing the makespan. If there are more than three machines, then it is NP-compelet problems and should be solved by metaheuristic algorithm. The objective of this article was to minimize total flowtime of jobs. To this end, the algorithm of electromagnetism-like method (EM) was applied, which utilized an attraction-repulsion mechanism to move the sample points toward optimality. The computational results demonstrated that EM was robust in practice. Moreover, this algorithm had two other advantages: i: simplicity of application and ii: occupying minor memory capacity. In the first stage, the base algorithm was developed by compensating for the lack of convergence. In the second stage, the parallel algorithm was applied. Finally, results of the algorithm were compared with those of other algorithms
Keywords:
Authors
Kamran Zamanifar
Department of computer engineering Isfahan University Isfahan, Iran.
Davood Fallahi
Department of computer engineering Payame Noor University, Tehran, Iran.
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :