بررسي مساله زمان بندي گروهي تك ماشين با فرض زوال تكه اي و با تابع هدف كمينه كردن مجموع ديركرد

چكيده انگليسي :

Single Machine Group Scheduling Problems with Peicewise Linear Deterioration Consideration for Minimizing Sum of Tardiness Fateme Besharati Mogaddam f besharatimoghadam@in iut ac ir Date of Submission Department Industrial and system Engineering Isfahan University of Technology Isfahan Iran Degree M Sc Language Farsi Supervisor Farimah Mokhatabrafii f mokhatabrafii@in iut ac ir AbstractIn classical scheduling problems the processing time of a job assumed to be constant This consumption is true in somecases but because machines and tools depreciate and their efficiency reduce during time this consumption cannot be truein all cases This assumption in many manufacturing environment is not correct and in practice we encounter theenvironments in which the various factors impress on the processing time and cause an increase or decrease in times So in many situation a job processed later consumes more time that the same job processed earlier This phenomenon iscalled deterioration For example Williams and Gupta and Gupta pointed outthat the ingot batches must be preheated tothe requiredtemperature in soaking pits before they can be hot rolledby a blooming mill in steel production KunnathurandGupta gave a fire fighting example where the timeand effort to cease a fire increase if there is a delay instarting thefire fighting In deteriorating job scheduling problems most of the researchers assume that the actual job processingtime is a function of its starting time Machine scheduling problems with deteriorating jobs have been paid more attentionin recent years In the current manufacturing environment gaining production efficiency is important while ensuring thatcustomer orders are delivered as close to their due date as possible Often grouping of jobs that tend to be similar in someway such as the required tooling in a family is desirable As a result of such a similarity a job does not need a setupwhen following another job from the same family but a known family setup time is required when a job follows amember of some other family Also the concept of group technology with different grouping parts and products and withthe same manufacturing and design cause increasing in efficiency and productivity However job deterioration is relativeunexplored in the context of group technology In many various criterion scheduling problems the objective function of sum of tardiness is very useful in applicationand industrial environment This is due to the corresponding objective function with cost of offseting the tardiness inproduction and assembly lines and in most cases is equvalent to the cost of losing costomers actually In a just in timeenvironment each job should be completed as close as possible to its due date Missing a job s duedate may result in theloss of the customer or the need tocompensate for the delay along the production or assembly line A single machine scheduling problem is studied There is a partiton of the set of n jobs into m groups on the basis ofgroup technology with piece wise deterioration consideration A common technique for solving large NP hardcombinatorial optimization problems is Branch and Bound B B algorithm This study contain single machinescheduling problem with deteriorated jobs and group technology suppostion to minimize sum of tardiness in which job sprocessing times is a non decreasing function based on the job starting time this problem is Np hard A branch and boundalgorithm incorporating with three properties a lower bound and an upper bound is developed to derive the optimalsolution Computational results for problems show that problems with jobs can be solved in all series Therefor the large size problems with using combination of genetic algorithm and electromagnetic method are solved and theanswers given is compared with genetic algorithm in terms of solution quality and time of solution Keywords Scheduling Single machine Deterioration Branch and Bound Group technology

بشارتي مقدم، فاطمه

بررسي مساله زمان بندي گروهي تك ماشين با فرض زوال تكه اي و با تابع هدف كمينه كردن مجموع ديركرد

شاخه و كران , تكنولوژي گروهي