Font Size: a A A

Research On Many Varieties Of Small Batch Quantities Of Discrete Manufacturing System Problem

Posted on:2015-05-23Degree:MasterType:Thesis
Country:ChinaCandidate:C ZhouFull Text:PDF
GTID:2309330476452205Subject:Industrial engineering
Abstract/Summary:PDF Full Text Request
Production scheduling is the core technology of workshop production and management. Reasonable shop scheduling can reduce in-process inventory, increase productivity and shorten the production cycle. With more variety and small batch production mode continue to rise, most companies abandon the traditional mode of existence, but the majority of this companies keep low production efficiency. The current production scheduling has become a constraint to enterprises to improve productivity and a key factor in shorten the production cycle. Flexible job-shop scheduling problem solves the traditional batch flexible job shop scheduling problem,not only with the the process of batch but also processing machine,and two important constraints on process.Each process can be processed on more than one machine, and the work piece is no longer a single piece. The problem compliance with reality of existing job shop production. So the question has important research value.Firstly, this paper introduces the purpose and significance of the research, outlining research status of flexible job shop with batches scheduling problem, and summarizes the main research methods at home and abroad for flexible job shop with batches scheduling problem.Secondly, for the flexible job shop with batches scheduling problem, the equal batches strategy is used, a mathematical model of flexible job shop with batches scheduling problem is built and double-coded genetic algorithm is designed to solve the flexible job shop with equal batches scheduling problem. The make span as the objective function, using the example of the data of reference, compared equal batches scheduling with whole batch scheduling production cycle, the equal batch scheduling proved shorten to the whole batch scheduling, feasibility of the algorithm validation.Thirdly, a further research on flexible job shop with batches scheduling problem is made, based on the flexible job shop with equal scheduling problem. And the flexible batch strategy is proposed, a flexible job shop with flexible batch scheduling problem mathematical model is built, the double coding genetic algorithm is used to solve this scheduling problem with the example of the data of reference, and the production cycle of entire batch scheduling compared with flexible batch scheduling, The flexible batches scheduling proved shorten to the whole batch scheduling, feasibility of the algorithm validation.Subsequently, a depth study of flexible job shop with batches scheduling problem is made based on flexible job shop with equal batches scheduling problem and flexible job shop with flexible batches scheduling problem.this two basic models and draw flexible batch job shop scheduling problems is improved, the genetic algorithms and made double-optimized solution is designed with a uniform initial experiments to solve this scheduling problem. using the example of the data of reference, the production cycle of entire batch scheduling with flexible batch scheduling compared. The flexible batches scheduling proved the whole batch scheduling shorten.Finally, the research in the dissertation is summarized, and the further research directions are discussed.
Keywords/Search Tags:Flexible Job Shop Scheduling Problem, Batch Scheduling, Genetic Algorithms, Uniform experiment, Makespan
PDF Full Text Request
Related items