Font Size: a A A

Study On Multi-objective Flexible Job-shop Scheduling Problem Based On Hybrid Genetic-tuba Search Algorithm

Posted on:2013-07-15Degree:MasterType:Thesis
Country:ChinaCandidate:C WangFull Text:PDF
GTID:2232330362974623Subject:Mechanical Manufacturing and Automation
Abstract/Summary:PDF Full Text Request
Job-Shop Scheduling is the core of the manufacturing enterprise productionmanagement; it plays an important role for enterprise profitability. After half a century,it has been made a wealth of theoretical results on the classical job-shop schedulingproblem, but the model can not reflect the actual production well and its guidancecannot be good. While multi-objective flexible job-shop scheduling problem that basedon the classical job-shop scheduling problem can include various demands of differentdepartments. It can better adapt to the modern production mode and the research on thishas important theoretical and practical significance.On the basis of the classical job shop scheduling, this issue describes the flexiblejob-shop scheduling problem, makes a mode for multi-objective flexible job-shopscheduling problem and design a hybrid algorithm. The main contents are as follows:①Proposed makespan, average flows time, the bottleneck machine load, the totalload of the machines, the delivery time of the workpiece, the processing costs of theworkpiece and product quality. Introduction of the multi-objective optimization conceptbased on different workpiece and method of calculation for each of the object.②Proposed a hybrid genetic-tabu search algorithm for the multi-objectiveoptimization mode that based on different workpiece, as well as a new way of crossoverthat based on processes and machines, and design a scheduling algorithm at the end.③Analysis of the commonly used multi-objective optimization algorithms, andselected an improved NSGA-II Pareto sorting method.④Established a mode that had dual constraints of machine and workers. Set thedelivery of the workpiece as the main target, and the total processing costs, thebottleneck machine load, the total completion time, the processing costs of a singleworkpiece, the quality of a single workpiece, the completion time of a single workpieceas the sub-optimal object.⑤The above mode and algorithm was simulated to verify its validity on the basisof actual project.
Keywords/Search Tags:Workpiece goal difference, Multi-objective flexible job-shop schedulingproblem, Hybrid genetic-tabu search algorithm, Multi-objective calculation method, Dual-resource constraints
PDF Full Text Request
Related items