4175

3946

كارشناسي ارشد

صنايع

اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها

1387

نه، 109، [II] ص: جدول، نمودار

ص.ع. به: فارسي و انگليسي

مهندسي صنايع و سيستم ها

ID3946

به فارسي و انگليسي: قابل رويت در نسخه ديجيتال

AbstractIn this study we consider the general lot sizing and scheduling problem in flexible flow shop GLSP FFS The GLSP FFS has not been considered in literature The GLSP FFS dealswith the issue of determining the lot sizes of several products and simultaneously schedulingthem on serially arranged manufacturing stages with parallel machines in each stage to satisfydeterministic and dynamic demand over a finite planning horizon Each item can beprocessed on each machine with different process rates and sequence dependent setup timesand setup costs The objective is to minimize all relevant costs which are inventory shortageand setup costs In this study three mathematical models are designed for this problem andefficiency of these models is discussed Also a simulated annealing and an efficient hybridheuristic algorithm consists of integrating simulated annealing and Lagrangean relaxation isproposed Finally computational results demonstrate the effictiveness of these algorithms incomparison with GAMS software solutions

مهدي بيجاري

ناصر ملاوردي

قاسم مصلحي