Font Size: a A A

Research And Implementation Of Dynamic Shop Scheduling System Based On Multi-objective

Posted on:2020-04-24Degree:MasterType:Thesis
Country:ChinaCandidate:R R ChengFull Text:PDF
GTID:2392330578977237Subject:Engineering
Abstract/Summary:PDF Full Text Request
In the job shop scheduling problem,from single machine scheduling to flexible job shop scheduling,the research on scheduling problem is gradually complicated,practical,and the research results are constantly optimized.However,the disturbance factors are inevitable in the actual processing and production process,and the occurrence of different dynamic events has a serious impact on the processing process,resulting in the phenomenon that the completion time of the order exceeds the scheduled delivery time,or the utilization rate of the machine is low.Therefore,timely processing of dynamic events can reduce the impact on the performance of the whole machining process.Firstly,based on the research background and present situation of job shop scheduling problem,the shortcomings of the current research on dynamic job shop scheduling problem are analyzed,and the commonly used optimization algorithms are summarized at the same time.Secondly,from the three angles of overall research,model research and solving algorithm,the dynamic job shop scheduling problem is briefly summarized,the model is established,the algorithm is solved,and the simulation experiment is carried out to realize the processing strategy of four kinds of dynamic events.Among them,the model research and solution algorithm part is the key content,the model research part,according to different processing strategies,the dynamic events are divided into new addition class,machine occupation class,exchange class and delay class event,and their processing strategy and flow are analyzed.The detailed mathematical model and constraint conditions are given.In the part of solving algorithm,particle swarm optimization is used as the optimization tool,the maximum completion time is minimized and the maximum machine load is minimized.As the optimization objective,the simulation experiment is carried out,and the disturbance influence rate of the rescheduling result relative to the original scheduling is compared to verify its effectiveness.At the same time,the disturbance influence rate of the rescheduling results with dynamic events in different periods is compared with that of the original scheduling,and the robustness of the rescheduling results is verified.Finally,a dynamic job shop scheduling system based on B/S architecture is designed,which includes two kinds of dynamic events:machine fault and delivery time,and the particle swarm optimization algorithm is applied to the optimization operation of the system.The system can deal with different dynamic events and give reasonable scheduling results.
Keywords/Search Tags:multiple objective, dynamic event, processing strategy, Job Shop scheduling system, Particle Swarm Optimization algorithm
PDF Full Text Request
Related items