Economic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 657
This Paper With 15 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-12-1_010
تاریخ نمایه سازی: 21 خرداد 1398
Abstract:
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be derived. The objective is to minimize the sum of setup costs, work-in-process inventory costs and finished products inventory costs per unit of time. Since the proposed model is NP-hard, an efficient Water Cycle Algorithm is proposed to solve the model. To justify proposed WCA, Monarch Butterfly Optimization (MBO), Genetic Algorithm (GA) and combination of GA and simplex are utilized. In order to determine the best value of algorithms parameters that result in a better solution, a fine-tuning procedure according to Response Surface Methodology is executed.
Keywords:
Lot sizing , Distributed permutation flow shops , Linearization , Water Cycle Algorithm , Monarch butterfly optimization
Authors
Mohammad Alaghebandha
Department of Industrial Engineering, Faculty of Engineering, Kharazmi University,Tehran, Iran
Bahman Naderi
Department of Industrial Engineering, Faculty of Engineering, Kharazmi University,Tehran, Iran
Mohammad Mohammadi
Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Tehran, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :