پديد آورنده :
باقري صمغ آبادي، شقايق
عنوان :
زمان بندي ماشين هاي موازي با هدف كمينه كردن هزينه كارهاي دير كرددار و هزينه ارسال با تحويل دسته اي
مقطع تحصيلي :
كارشناسي ارشد
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
ده،98ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
توصيفگر ها :
سيستم هاي يكپارچه توليد و توزيع ﴿IPODS﴾ , مدل برنامه ريزي عدد صحيح مختلط , الگوريتم شاخه و كران , الگوريتم ژنتيك
تاريخ نمايه سازي :
17/6/92
استاد داور :
مهدي بيجاري، فريماه مخاطب رفيعي
دانشكده :
مهندسي صنايع و سيستم ها
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Scheduling parallel machine to minimize costs of tardy jobs and delivery costs with batch delivery Shaghayegh Bagheri Samgh Abadi s bagherisamghabadi@in iut ac ir Seyed Reza Hejazi Supervisor rehejazi@cc iut ac ir Department of Industrial and Systems Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language Persian Date 2013 02 19 Abstract Production and distribution scheduling are quite important from both theoretical and practical points of view Integration of production and outbound distribution scheduling has recently attracted significant amount of research In classical scheduling problems coordination with transportation unit and dispatching situations has not been involved directly and decisions about them have been made independently On the other hand integrated decisions on product scheduling and distribution planning which is a more comprehensive view to this problem decreases the costs of production system lead to more profit improve quality of service and increase the satisfaction of customers Although because of being many applied problems the researches on this area have been increased in recent decades there is not a significant study on integrated decisions on production scheduling and distribution planning Due to importance of objective function of tardy cost total weighted number of tardy jobs on the satisfaction of customers in this study we tried to propose exact and inexact methods to solve the problem of scheduling of similar parallel machines with delivery batching using minimum tardy cost and delivery cost objective function In this study two models of mixed integer programming are developed to solve the mentioned problem After this for presenting a more powerful exact method for the considered problem We suggested a branch and bound algorithm To implement our approach we developed a heuristic method to create a primary upper bound lower bounds and instructions which decrease the answer space The proposed branch and bounding method can solve 86 of problems with 20 tasks and 5 machines in 3600 seconds Since in practice there are many large scale problems which cannot be solved in a reasonable time a Genetic Algorithm approach is also proposed to approximate the true answers in a shorter time for large scale problems Keywords integrated production and outbound distribution systems mixed integer programming branch and bound algorithms genetic algorithm PDF created with pdfFactory trial version www pdffactory com
استاد داور :
مهدي بيجاري، فريماه مخاطب رفيعي
