Research of a Constraint-Based Particla Swarm Optimization and Genetic Algorithm Approach for Scheduling Problems
碩士 === 清雲科技大學 === 電子工程研究所 === 95 === The job-shop scheduling(JSP) problem is a process of assigning a limited number of machines to operations over time in a consistent manner. Existing particle swarm optimization (PSO) designed for the JSP are devise an appropriate representation of solutions toget...
Main Authors: | Shun-Yuan Cheng, 鄭舜源 |
---|---|
Other Authors: | Pei-Lun Hsu |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/22834556468896486387 |
Similar Items
-
Research of a Constraint-Based Particle Swarm Optimization and Genetic Algorithm Approach for Scheduling Problems
by: Shun-Yuan Cheng, et al.
Published: (2008) -
Integration of Genetic Algorithms and Binary Particle Swarm Optimization for RFID Networks Scheduling Problems
by: Cheng-Hsin Ke, et al.
Published: (2009) -
Research of a Constraint-Based Genetic Algorithm Approach for Scheduling and Rescheduling Problems
by: Jhih-Ming Huang, et al.
Published: (2007) -
OPTIMAL UNIT COMMITMENT SCHEDULING FOR COGENERATION BY GENETIC ALGORITHMS
by: Shun-Hsien Huang, et al.
Published: (1999) -
Research of a Constraint-Based Particle Swarm Optimization and Genetic Algorithm Approach for Mining Classification Rule
by: Feng-Tse Chan, et al.
Published: (2009)