SHANDONG SCIENCE ›› 2017, Vol. 30 ›› Issue (6): 105-119.doi: 10.3976/j.issn.1002-4026.2017.06.017

• Other Research Article • Previous Articles     Next Articles

Improved discrete particle swarm optimization algorithm to solve the reentrant jobshop scheduling problem

WAN Jing   

  1. Shandong Technological Center of Oceanographic Instrumentation，Institute of Oceanographic Instrumentation, Shandong Academy of Sciences，Qingdao 26600, China
  • Received:2017-01-03 Published:2017-12-20 Online:2017-12-20

PDF (PC)

Like

Abstract:

In this paper, by combining the existing discrete particle swarm optimization algorithm with a small but effective local search, an effective hybrid discrete particle swarm optimization algorithm was formed. This paper also discussed how to fuse the local search to optimize the discrete particle swarm. And the effectiveness of the proposed algorithm has been proved by the comparison of the simulation results.

Key words: local search, discrete particle swarm optimization algorithm, job-shop

CLC Number: 

  • TP301.6

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0

鲁ICP备10205608号
Website Copyright © Editorial Office of Shandong Science
Tel: 0531-82605310　E-mail: xuxy@qlu.edu.cn
Powered by Beijing Magtech Co. Ltd