Tow Meta heuristic method for the common cycle economic lotsizing and scheduling in flexible flow shops with limited intermediated buffers: The finite horizon case

Publish Year: 1392
نوع سند: مقاله کنفرانسی
زبان: English
View: 457

This Paper With 17 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICPEEE01_2123

تاریخ نمایه سازی: 16 شهریور 1395

Abstract:

This paper addresses the common cycle multi-product lot sizing and scheduling problem in deterministic flexible flowshops where the planning horizon is finite and fixed by management and stages in series, separated by finite intermediate buffers. The limited intermediate buffers between the stages result in a blocking scheduling problem, where a completed part may remain on a machine and block it until a downstream machine becomes available. This prevents another part from being processed on the blocked machine. We develop a new mixed integer nonlinear program and Due to difficulty of obtaining the optimal solution in medium and large-scaled The First International Conference on Political Epic (with an Approach to Middle East Developments) & Economic Epic (with an Approach to Management and Accounting) problems, a genetic algorithm and tabu search is developed to find an optimal or near-optimal solution for these problems. Two proposed solution methods are compared with optimal enumeration method (OEM) on randomly generated problems, and computational results show that the performance of GA and TS are very promising.

Authors

Reza Abdollahzadeh

Department of Academic Staff Member of Islamic Azad University, Gare Ziaeddin Center, khoy, Iran

B Akrami

Department of Academic Staff Member of Islamic Azad University, Gare Ziaeddin Center, khoy, Iran