عنوان :
تعيين اندازه ي انباشته در مسئله ي كنترل موجودي با تقاضاي پوياي احتمالي با در نظر گيري تخفيف كلي
مقطع تحصيلي :
كارشناسي ارشد
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
يازده، 85ص.: مصور
استاد راهنما :
حميد ميرمحمدي
توصيفگر ها :
شاخه و كران , برنامه ريزي پويا , آزادسازي لاگرانژ , مجموعه ي فعال
تاريخ نمايه سازي :
1394/09/03
استاد داور :
رضا حجازي، مهدي بيجاري
تاريخ ورود اطلاعات :
1396/10/05
رشته تحصيلي :
صنايع و سيستم ها
دانشكده :
مهندسي صنايع و سيستم ها
چكيده انگليسي :
Stochastic Dynamic Lot Sizing Problem with Total Quantity Discount Saba Khosravi s khosravi@in iut ac ir Date of Submission 2015 08 08 Department of Industrial Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language FarsiSupervisor Dr Seyed Hamid Mirmohammadi h mirmohammadi@cc iut ac irAbstractDynamic lot sizing problem is one of the significant problem in industrial units and it has been consideredby many researchers Considering the quantity discount in goods purchasing cost is one of the importantand practical assumptions in the field of inventory control models and it has been less focused in terms ofstochastic version of dynamic lot sizing problem In this study stochastic dynamic lot sizing problem withconsidering the quantity discount is defined and formulated Since the considered model is mixed integernon linear programing piecewise linear approximation is also presented In order to solve the mixed integernon linear programing two approaches are presented The main solving approach is using a branch andbound algorithm B B Each node in the branch and bound algorithm is a mixed integer non linearprogramming problem which is solved based on dynamic programming DP In each stage in this dynamicprogramming there is a sub problem which can be solved with two methods lagrangian relaxation LR and active set method AS The numeric results found in this study indicate that the proposed algorithms B B DP AS and B B DP LR solve the problem faster than the mathematical solution using thecommercial software GAMS Between the two algorithms B B DP AS algorithm can reach the optimalsolution with less time Moreover the proposed algorithms for the two discount levels are also comparedwith the approximate solution in mentioned software The results indicate that B B DP AS algorithm for16 periods not only can reach to the exact solution it consumes less time in contrast to the approximatemodel Keywords Dynamic Lot Sizing Problem Total Quantity Discount Branch and Bound Algorithm DynamicProgramming Lagrangian Relaxation Method Active Set Method
استاد راهنما :
حميد ميرمحمدي
استاد داور :
رضا حجازي، مهدي بيجاري
