摘要
A novel particle swarm optimization (PSO)-based algorithm is developed for job-shop scheduling problems (JSSP), which are the most general and difficult issues in traditional scheduling problems. Our goal is to develop an efficient algorithm based on swarm intelligence for the JSSP. Thereafter a novel concept for the distance and velocity of particles in the PSO is proposed and introduced to pave the way for the JSSP. The proposed algorithm effectively exploits the capabilities of distributed and parallel computing systems, with simulation results showing the possibilities of high quality solutions for typical benchmark problems.
学科与关键词
关键词
Job-shop schedulingparticle swarm optimizationsimilarity measure
- An effective PSO and AIS-based hybrid intelligent algorithm for job-shop schedulingGe, Hong-Wei; Sun, Liang; Liang, Yan-Chun*; Qian, FengIEEE Transactions on Systems, Man and Cybernetics Part A: Systems and Humans. , 2008, 38(2): 358-368.被引 92
- An improved particle swarm optimization algorithm for flowshop scheduling problemZhang, Changsheng*; Sun, Jigui; Zhu, Xingiun; Yang, QingyunINFORMATION PROCESSING LETTERS, 2008, 108(4): 204-209.被引 30
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasksTseng, Chao-Tang; Liao, Ching-Jong*International Journal of Production Research, 2008, 46(17): 4655-4670.被引 89
