استخدام البرمجة الديناميكية لحل مشكلة جدولة انتاج متعدد لماكنة منفردة لكلفة خزين متغيرة == Using Dynamic Programming To Solve The Multi - Item Single Machine Scheduling Production Problem For Variable Inventory Cost
Author name:
حيدر عدنان امير
Supervisor name:
لميعة باقر جواد الجواد
General topic:
Administration and Economics
Specific topic:
Operations Research
Degree:
Master
University:
University of Baghdad - Faculty Of Administration And Economics - Department Of Statistics
Language:
Arabic
University location:
Baghdad
First pages:
07T3593 - p.pdf
Abstract:
الغرض من هذا البحث هو تطبيق اسلوب البرمجة الديناميكية Dynamic Programming لتخطيط الانتاج لمنتج واحد او اكثر بواسطة ماكنة واحدة ولعدة انواع من دوال الكلفة الخطية والمقعرة والمحدبة. سوف نهتم بتخطيط الانتاج لفترة زمنية مستقبلية تسمى ( فترة التخطيط ) Planning | The purpose from this research is to apply one of operations researches manners and its Dynamic Programming manner, to planning for one manufacturer or more and for many types from linear cost functions, convex and concave which are manufacture by lonely machine.We will pay attention in manufacturing planning for future chronological period named Planning Horizon for a machine is manufacturing many manufacturers with a machine changeover cost, where in this period the ordering average is change on the manufacturer, we’ll suppose too that the chronological space is divided to periods , the planning problem is happening by determining manufacturing average for every period in Planning Horizon , for knowing the ordering on every period is known but it’s not constant from each period to other which give it the Dynamic Form.In the research aim about how we planning for manufacturing period, so it will be study different models for cost function in one manufacturer case or more and apply an algorithm for each case and after that programming some of these algorithms to determining the best Planning Horizons where at them wholly cost function is might less.This subject consider as one of the important subjects in manufacturing operation fields, industrial operations, geometric operations and etc …For the important of leather industries, this subject apply on the factories of the Common Company of Leather Industries and that is happen by planning for outputting and stock to find less possible cost and the choice happen for four factories from the company and it’s : 1. Baghdad shoes factory ( Bata previously )2. kufa factory ( sporty shoes )3. Bags factory 4. Leather clothes factory And this by forming models to Dynamic Programming and it’s : 1. forward algorithm without disability 2. forward algorithm with disability 3. backward algorithm allow disabilityIt’s developing by the researcher to apply it in the multiple outputting and solve them and taking the results through a computer program written by the researcher for every model in Visual Basic Language.
