DocumentCode :
2650391
Title :
Minimizing makespan in job-shop scheduling problem using an improved adaptive particle swarm optimization algorithm
Author :
Gu, Wenbin ; Tang, Dunbing ; Zheng, Kun
Author_Institution :
Coll. of Mech. & Electr. Eng., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China
fYear :
2012
fDate :
23-25 May 2012
Firstpage :
3189
Lastpage :
3193
Abstract :
This paper proposes an improved adaptive particle swarm optimization algorithm (IAPSO) for the minimization of makespan in job shop scheduling problems (JSP). Inspired by hormone modulation mechanism, an adaptive hormonal factor (HF) is designed to be used in the updating equations of particle swarm. Using the HF, each particle of the swarm can adjust its particle position self-adaptively to avoid the premature phenomena and get better solution. Computational experiments demonstrate that the proposed IAPSO reaches high-quality solutions in short computational times. By employing IAPSO, machines can be used more efficiently, which means tasks can be allocated appropriately, production efficiency can be improved, and the production cycle can be shortened efficiently.
Keywords :
job shop scheduling; minimisation; particle swarm optimisation; IAPSO; adaptive hormonal factor; hormone modulation mechanism; improved adaptive particle swarm optimization algorithm; job-shop scheduling problem; minimization; production efficiency; Biochemistry; Convergence; Encoding; Hafnium; Job shop scheduling; Modulation; Particle swarm optimization; Hormone modulation mechanism; Improved adaptive particle swarm optimization algorithm (IAPSO); Job-shop scheduling problem (JSP); minimum makespan;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference (CCDC), 2012 24th Chinese
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4577-2073-4
Type :
conf
DOI :
10.1109/CCDC.2012.6243080
Filename :
6243080
Link To Document :
بازگشت