4427

4177

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

صنايع

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

1387

[هشت]، 108،[II] ص.: جدول، نمودار

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

مهدي بيجاري

فريماه مخاطب رفيعي

19/1/88

قاسم مصلحي

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

ID4177

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

Abstract Flow shop scheduling problem has a lot of applications in industry Manyresearchers have worked and are working on this subject so a lot of papers are beingpublished in this field in scientific journals every year Most of these papers are aboutminimizing makespan in flow shop production environment But more and less researcheswith other objectives or with specific hypothesis are done in such productionenvironments In the other way production smoothing also has assigned an extensive part ofresearches to itself The importance of it especially in Just in Time productionenvironments has attracted the interests of many researchers However there are a little works on those above mentioned cases simultaneously Flow shop scheduling problem with sequence dependent set up times is consideredin this paper The objective is minimizing the makespan by considering productionsmoothing Here the smoothing is decreasing the deviation of production rate of jobs ofusing rate of them It is shown that solving of this problem is NP hard A Branch and Bound B B algorithm is suggested to solve the problem Also a heuristic algorithm with rather goodsolving is used to analyze the results in larger problems The B B algorithm is applied to2040 test problems with three amounts of parameter and once without the parameter It isshown that the suggested algorithm is able to reach to optimum solving for problems withmaximum 14 places

مهدي بيجاري

فريماه مخاطب رفيعي

قاسم مصلحي