A new pheromone design in ACS for solving JSP

  title={A new pheromone design in ACS for solving JSP},
  author={Xiao-Ian Zhuo and Jun Zhang and Wei-neng Chen},
  journal={2007 IEEE Congress on Evolutionary Computation},
Job shop scheduling problem (JSP) is one of the most difficult NP-hard combinatorial optimization problems due to the "combination explosion" effect. This paper presents the implementation of ant colony system on JSP by proposing a novel combination of path-construction and pheromone-representation. Based on the simple traditional path-construction, a kind of more effective pheromone is employed to improve the optimization performance. Numerical experiment is executed on several benchmark JSP… CONTINUE READING