An Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
سال انتشار: 1387
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 484
فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-2-4_006
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times are neglected or considered independent from sequences of jobs. In this paper we study the hybrid flow shop problems with sequence dependent setup times and processor blocking. We present an effective hybrid genetic algorithm with some state-of-the-art procedures for these NP-hard problems to minimize total completion time or makespan. We established a benchmark to draw an analogy between the performance of our algorithm and RKGA. The obtaining results clearly show the superiority performance of our algorithm.
کلیدواژه ها:
Hybrid flow shop ، sequence dependent setup times ، Processor blocking ، Genetic algorithm ، Local search
نویسندگان
Mostafa Zandieh
Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran
Eghbal Rashidi
Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran