Dissertation > Excellent graduate degree dissertation topics show

Multi-Objective Shop Scheduling Algorithm Based on Particle Swarm Optimization

Author: DingYingJuan
Tutor: GaoLiang
School: Huazhong University of Science and Technology
Course: Industrial Engineering
Keywords: Flow-shop Scheduling Job-shop Scheduling Flexible Job-shop Scheduling multi-objective Particle Swarm Optimization
CLC: F224
Type: Master's thesis
Year: 2007
Downloads: 528
Quote: 3
Read: Download Dissertation

Abstract


Recently, multi-objective scheduling is becoming a hot research topic of shop scheduling. Particle Swarm Optimization (PSO) algorithm is a simple and effective method, which simulates the activities of biologic colony. PSO algorithm’s speciality of multi-point parallel search makes it be applicable to multi-objective optimization problem’s solving. This work concentrates on three multi-objective shop schedulings based on PSO algorithm.Firstly, the three kinds of solving methods about multi-objective shop scheduling are introduced. The PSO algorithm is also introduced and its development are reviewed. The basic application of PSO algorithm and the research actuality of multi-objective PSO algorithm are summarized.Secondly, multi-objective Flow-shop Scheduling Problem (FSP) based on PSO is researched and PSO algorithm which competently solve multi-objective FSP is constructed. In the algorithm, PMX crossover operator is used to realize particle’s renewal, vicinage framework (key path) based on scheduling problem is used to realize particle’s local search, and inserting mutation operator is used to realize particle’s random search. The algorithm’s efficiency and superiority are indicated through experimental results.Thirdly, basing on multi-objective FSP has been solved, more complicated multi-objective Job-shop Scheduling Problem (JSP) based on PSO is researched and PSO algorithm that can solve multi-objective JSP is constructed. In the algorithm, crossover operator based on workpiece is used to realize particle’s renewal, Tabu Search (TS) is used to realize particle’s local search, and changing position mutation operator is used to realize particle’s random search. This algorithm’s feasibility and superiority are also validated through the experimental results based on normal testing problem.Fourthly, according to the experience of solving multi-objective JSP successfully, more complicated multi-objective Flexible Job-shop Scheduling Problem (FJSP) based on PSO is researched. Basing on the characteristic of multi-objective FJSP, Coding precept based on both working procedure sequence and machine assigning is designed. Crossover operator and mutation operator based on both working procedure sequence and machine assigning is also used as particle’s renewal strategy and random search strategy. And TS is also used as particle’s local search. So, the PSO algorithm which competently solves multi-objective FJSP is constructed. And its efficiency and advantage are also proved through experimental results.Finally, conclusion is drawn and the future research focus about multi-objective PSO and multi-objective shop scheduling is pointed out.

Related Dissertations

  1. Research on Scheduling of Whole-set Orders in JSP Based on Differential Evolution Algorithm,F273
  2. Research on the Improvements and Applications of Particle Swarm Optimization,TP18
  3. A Flow-shop S with Parameters Research of Complexity and Heuristic Lgorithms for the Parallel Machine and Cheduling Problems,O223
  4. Machine-scheduling Problems with the Learning Effect and Deteriorated Jobs,O223
  5. Development and Simulation Analysis of Job-shop Scheduling System,TH165
  6. Based hybrid algorithm for job shop scheduling problem,TH186
  7. A New Genetic Algorithm for a Kind of Flow Shop Problems and Applications,TP18
  8. Cellular Particle Swarm Optimization and Its Applications on Flexible Job Shop Scheduling Problem,TP301.6
  9. Multi-Objective Flexible Job Shop Scheduling Problem Based on Hybrid Particle Swarm Optimization,TP301.6
  10. Research on Hybrid Robust Scheduling for Flow Shop under Uncertainty,O224
  11. Research and Application of Multi-objective Genetic Algorithm Based on Improved Banker Law and Clustering,TP18
  12. The Application in Production Scheduling Based on Cooperative Particle Swarm Optimization Algorithm,F224
  13. Research on Production Planing and Control of the Enterprise of Antomobile Strandard Parts Based on JIT Production Mode,U468
  14. Research and Application of Flow-Shop Scheduling Methods Based on Hybrid Quantum-Inspired Evolutionary Algorithm,TP301.6
  15. Under Uncertainty Based on Genetic Algorithm for Flexible Job Shop Scheduling Problem,TH165
  16. Solving Permutation Flow Shop Problem by Ant Algorithms,TP301.6
  17. Scheduling Method Research Based on Hybrid Differential Evolution and Application in Chemical Workshop,TQ021.8
  18. Research on Job-Shop Scheduling Problem Based on Improved Genetic Algorithm,TP18
  19. Co-operative Ant Colony Optimization Algorithm in Production Scheduling Problems,TP301.6
  20. Research on Dual-resource Multi-objective Flexible Job Shop Scheduling Problem,F273
  21. An improved estimation of distribution algorithms and application,TP301.6

CLC: > Economic > Economic planning and management > Economic calculation, economic and mathematical methods > Economic and mathematical methods
© 2012 www.DissertationTopic.Net  Mobile