Skip to main content
SpringerLink
Log in

PSO with Improved Strategy and Topology for Job Shop Scheduling

  • Conference paper
Advances in Natural Computation (ICNC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4222))

Included in the following conference series:

Abstract

Particle swarm optimization (PSO) has proven to be a promising heuristic algorithm for solving combinatorial optimization problems. However, N-P hard problems such as Job Shop Scheduling (JSSP) are difficult for most heuristic algorithms to solve. In this paper, two effective strategies are proposed to enhance the searching ability of the PSO. An alternate topology is introduced to gather better information from the neighborhood of an individual. Benchmarks of JSSP are used to test the approaches. The experiment results indicate that the improved Particle Swarm has a good performance with a faster searching speed in the search space of JSSP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Simulated Annealing Oper. Res. 40, 113–125 (1992)

    Google Scholar 

  2. Yin, A., Huang, W.: A stochastic strategy for solving job shop scheduling problem. In: Proceeding of the First International Conference of Machine Learning and Cybernetics (2002)

    Google Scholar 

  3. Zhang, H., Li, X., Zhou, P.: A Job Shop Oriented Virus Genetic Algorithm. In: Proceeding of the 5th World Congress on Intelligent Control and Automation (June 2004)

    Google Scholar 

  4. Kennedy, J., Mendes, R.: Population Structure and Particle Swarm Performance. In: IEEE 2002 (2002)

    Google Scholar 

  5. Kennedy, J.: Small Worlds and Mega-Minds: Effects of Neighborhood Topology on Particle Swarm Performance. In: IEEE 1999 (1999)

    Google Scholar 

  6. Kennedy, J., Neves, J.: The Fully Informed Particle Swarm: Simpler, Maybe Better. IEEE Transactions on Evolutionary Computation 8(3) (June 2004)

    Google Scholar 

  7. French, S.: Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop. John Wiley & Sons, Inc., New York (1982)

    MATH  Google Scholar 

  8. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th Symp. MicroMachine and Human Science, Nagoya, Japan, pp. 39–43 (1995)

    Google Scholar 

  9. Yang, C., Simon, D.: A new particle swarm optimization technique. In: 18th International Conference on Systems Engineering, ICSEng 2005, August 16-18, 2005, pp. 164–169 (2005)

    Google Scholar 

  10. Dorndorf, Pesch, E.: Evolution based learning in a job-shop environment. Computers and Operations Research 22, 25–40 (1995)

    Article  MATH  Google Scholar 

  11. Bean: Genetic algorithms and Random Keys for sequencing and optimization. ORSA J. Computing 6, 154–160 (1994)

    MATH  Google Scholar 

  12. Bierwirth: A generalized permutation approach to job-shop scheduling with genetic algorithms. OR SPEKTRUM 17(2-3), 870–892 (1995)

    Google Scholar 

  13. Hong-Fang, Z., Xiao-Ping, L., Pin, Z.: A job shop oriented virus genetic algorithm. In: Intelligent Control and Automation, WCICA 2004, Fifth World Congress, June 15-19, 2004, vol. 3, pp. 2132–2136 (2004)

    Google Scholar 

  14. Watanabe, M., Ida, K., Gen, M.: Active solution space and search on job-shop scheduling problem. Electrical Engineering in Japan 154(4), 61–67 (2006)

    Article  Google Scholar 

  15. Ling, W.: Shop Scheduling with Genetic Algorithm. Tsinghua University Press (2003)

    Google Scholar 

  16. Mattfeld, D.C., Vaessens, R.J.M.: OR-Library, http://mscmga.ms.ic.ac.uk/jeb/orlib/jobshopinfo.html

  17. Wei-jun, X., Zhi-ming, W.: A hybrid particle swarm optimization approach for the job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 1433–3015 (2005)

    Google Scholar 

  18. Liu, B., Wang, L., Yi-Hui, J.: An effective hybrid particle swarm optimization for no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 1433–3015 (January 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, South China University of Technology, Guangzhou, 510640, P.R. China

    Kun Tu & Zhifeng Hao

  2. College of Mathematical Science, South China University of Technology, Guangzhou, 510640, P.R. China

    Kun Tu

  3. National Mobile Communications Research Laboratory, Southeast University, Nanjing, 210096, P.R. China

    Zhifeng Hao & Ming Chen

Authors
  1. Kun Tu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhifeng Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  3. School of Electronic Engineering, Xidian Univ., P.O. Box, 710071, Xi’an, P.R. China

    Xinbo Gao

  4. College of Mathematics and Information Science, Hebei Normal University, 050016, Shijiazhuang, Hebei, P.R. China

    Jing Liu

  5. Multi-Agent Systems Lab,Department of Computer Science, University of Science and Technology of China, 230026, Hefei, China

    Feng Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tu, K., Hao, Z., Chen, M. (2006). PSO with Improved Strategy and Topology for Job Shop Scheduling. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_19

Download citation

  • DOI: https://doi.org/10.1007/11881223_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45907-1

  • Online ISBN: 978-3-540-45909-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation