Font Size: a A A

Research On Flexible Job-Shop Static Scheduling Problem And Algorithm

Posted on:2014-03-24Degree:MasterType:Thesis
Country:ChinaCandidate:S YanFull Text:PDF
GTID:2252330392971411Subject:Mechanical Manufacturing and Automation
Abstract/Summary:PDF Full Text Request
As the21st century, the global manufacturing industry has undergone enormouschanges in market demand unpredictable. In order to meet the changing needs of themarket, manufacturing companies have had less variety and large volume productionmodel to multi-variety, small batch production mode. Manufacturing plant as a coremanufacturing companies, both physical and chemical enterprise information centersare also distributing center. Manufacturing production processes face many problems,and shop scheduling problem is one of the very intractable problems. Shop schedulingis the use of a variety of simple, practical and efficient scheduling techniques tomaximize the use of existing resources and reduce unnecessary waste, therebyimproving production efficiency, reduce production costs, and promote healthy andrapid development. Thus this shop scheduling problem studied not only has a strongtheoretical significance, but also has a high practical value.Ant colony algorithm is a recently developed a simulation of intelligent algorithmhas strong robustness, in essence, parallelism, etc., can be obtained better solution tothe problem, more and more researchers to apply shop scheduling problem to study.This study is expanded around the ant colony algorithm in production scheduling; themain work is as follows:①Describes the purpose and significance of topics, summed up the job shopscheduling research status and Ant Colony Algorithm for Job Shop SchedulingResearch.②An overview of the basic theory of shop scheduling problems, including theproblem of classification shop scheduling, performance indicators, characteristics,research methodology and representation, on this basis, highlights the flexible job shopscheduling classification, evaluation, solution methods and mathematical models.③Describes the basic principles of ant colony algorithm to TSP problem as anexample of the algorithm model, model solution processes, etc., and finallysummarizes the advantages and disadvantages of the ant colony algorithm.④In the basic ant colony algorithm, based on the classic job shop schedulingproblem for the limitations, combined with the actual production of manufacturingenterprises and the principle characteristics of ant colony algorithm, ant colonyalgorithm for local improvements. In the existing Ant colony algorithm to solve TSP problems made a general model of the corresponding number of changes to make theimproved model can better solve the flexible job shop scheduling problem. Finally,examples demonstrate improved ant colony algorithm to solve the static job shopscheduling problem is feasible and effective.
Keywords/Search Tags:Ant Colony Algorithm, Improved Ant Colony Algorithm, Flexible Job-shop Scheduling, Production Scheduling
PDF Full Text Request
Related items