Journal of Northeastern University ›› 2008, Vol. 29 ›› Issue (4): 565-568.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Job shop scheduling and its optimization based on particle swarm optimizer

He, Li (1); Liu, Yong-Xian (1); Xie, Hua-Long (1); Liu, Xiao-Tian (1)   

  1. (1) School of Mechanical Engineering and Automation, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-04-15 Published:2013-06-22
  • Contact: He, L.
  • About author:-
  • Supported by:
    -

Abstract: Considering the conventional algorithms' low efficiency of search especially global search, PSO-based solution to job shop scheduling problem is presented. According to the characteristics of the problem, the PSO coding and optimization are studied to determine the way of coding and operation, which is more adaptable to job shop scheduling. The job shop scheduling part of the system is then programmed with the algorithm. Simulation results showed that setting the suitable parameters can provide an excellent working sequence to adapt to the dynamic job-shop problem.

CLC Number: