5423

5083

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

صنايع

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

1389

نه،100ص.: مصور،جدول،نمودار

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

مهدي بيجاري

قاسم مصلحي

21/6/89

علي شاهنده

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

ID5083

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

Profit Maximization General Lot sizing and Scheduling Problem with Demand Choice Flexibility Narges Sereshti N sereshti@in iut ac ir Date of Submission 2009 05 9 Department of Industrial Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language FarsiSupervisor Mehdi Bijari Bijari@cc iut ac irAbstract Lot sizing and scheduling are two important issues in the field of production planning Despite the factthat these issues are dependent to each other in most researches they analyzes separately and hierarchically Considering the relationship the general lot sizing and scheduling problem GLSP consider these twoissues as one problem Basic consumption in most researches in the field of lot sizing and scheduling and specifically in GLSPmodels is that companies should respond to all predetermined demands but in a business with goal ofmaximizing benefit fulfilling all demand maybe is not the best answer In this thesis profit maximizationgeneral lot sing and scheduling problem with demand choice flexibility PGLSP is studied This problem isan extension of GLSP by adding demand choice flexibility In other words amount of demand accepted ineach period lot sizing and scheduling are problems which considered simultaneously in this problem Accepted demand is between upper bound and lower bound of it in each period With regard to thisconsumption the classic objective function of the model i e minimizing costs is change to maximizing netprofit In this thesis four models are represented for the problem and their efficiency is analyzed in differentgroups of problems These models were different in the way of lot sizing and scheduling The first and thesecond models use micro periods for products sequencing These micro periods do not exist in third and forthmodels and these models consider sequencing problem like a TSP model Lots in the first and third modelsare determined by the unit of products which produce in each period while in the second and forth modelsthey separated by the period which they use Changes needed in each of presented models by addingminimum lot size constraint and without existing triangular inequality between setup times are alsoconsidered Seven heuristic algorithms are presented and compare on the basis of rolling horizon and fix and relaxmethods While these algorithms reduce the solving time of the problem their answers have a very goodquality Keywords Lot sizing Scheduling Profit maximization Demand choice flexibility

مهدي بيجاري

قاسم مصلحي

علي شاهنده