Skip to main content
SpringerLink
Log in

Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm

  • Conference paper
Swarm and Evolutionary Computation (EC 2012, SIDE 2012)

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

Abstract

This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the fuzzy makespan. In the proposed PSO-based algorithm performs global explorative search, while the tabu search (TS) conducts the local exploitative search. One-point crossover operator is developed for the individual to learn information from the other individuals. Experimental results on three well-known benchmarks and a randomly generated case verify the effectiveness and efficiency of the proposed algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Wang, L., Zheng, D.Z.: A modified genetic algorithm for job shop scheduling. Int. J. Adv. Manuf. Technol. 20, 72–76 (2002)

    Article  Google Scholar 

  2. Kuroda, M., Wang, Z.: Fuzzy job shop scheduling. Int. J. Prod. Econ. 44(1), 45–51 (1996)

    Article  Google Scholar 

  3. Sakawa, M., Mori, T.: An efficient genetic algorithm for job shop scheduling problems with fuzzy processing time and fuzzy due date. Comput. Ind. Eng. 36(2), 325–341 (1999)

    Article  Google Scholar 

  4. Sakawa, M., Kubota, R.: Fuzzy programming for multi-objective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm. Eur. J. Oper. Res. 120(2), 393–407 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Song, X.Y., Zhu, Y.L., Yin, C.W., Li, F.M.: Study on the combination of genetic algorithms and ant colony algorithms for solving fuzzy job shop scheduling. In: Proceedings of the IMACS Multi-Conferences on Computational Engineering in Systems Application, Beijing, pp. 1904–1909 (2006)

    Google Scholar 

  6. Inés, G.R., Camino, R.V., Jorge, P.: A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty. J. Intell. Manuf. 21, 65–73 (2010)

    Article  Google Scholar 

  7. Lei: Solving fuzzy job shop scheduling problems using random key genetic algorithm. Int. J. Adv. Manuf. Technol. 49, 253–262 (2010)

    Article  Google Scholar 

  8. Wu, C.S., Li, D.C., Tsai, T.I.: Applying the fuzzy ranking method to the shifting bottleneck procedure to solve scheduling problems of uncertainty. Int. J. Adv. Manuf. Technol. 31(1-2), 98–106 (2006)

    Article  Google Scholar 

  9. Lei, D.M.: Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems. Int. J. Adv. Manuf. Technol. 37(1-2), 157–165 (2007)

    Article  Google Scholar 

  10. Niu, Q., Jiao, B., Gu, X.S.: Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time. Applied Mathematics and Computation 205, 148–158 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43. IEEE Service Center, Piscataway (1995)

    Chapter  Google Scholar 

  12. Sha, D.Y., Hsu, C.Y.: A hybrid particle swarm optimization for job shop scheduling problem. Computers and Industrial Engineering 51(4), 791–808 (2006)

    Article  Google Scholar 

  13. Glover, F.: Tabu Search: A Tutorial. Interfaces 20(4), 74–94 (1990)

    Article  Google Scholar 

  14. Li, J.Q., Pan, Q.K., Liang, Y.C.: An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems. Computers and Industrial Engineering 59(4), 647–662 (2010)

    Article  Google Scholar 

  15. Li, J.Q., Pan, Q.K., Suganthan, P.N., Chua, T.J.: A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 52(5-8), 683–697 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Liaocheng University, Liaocheng, 252059, China

    Junqing Li & Quan-Ke Pan

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

    P. N. Suganthan

  3. Industrial Engineering Department, Yasar University, Izmir, Turkey

    M. Fatih Tasgetiren

Authors
  1. Junqing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quan-Ke Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. N. Suganthan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Fatih Tasgetiren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski , Marcin Korytkowski  & Rafał Scherer ,  & 

  2. AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Computer Science Division, University of California Berkeley, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Computational Intelligence Laboratory, Electrical and Computer Engineering, University of Louisville, 405 Lutz Hallz, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, J., Pan, QK., Suganthan, P.N., Tasgetiren, M.F. (2012). Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Swarm and Evolutionary Computation. EC SIDE 2012 2012. Lecture Notes in Computer Science, vol 7269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29353-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29353-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29352-8

  • Online ISBN: 978-3-642-29353-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation