Skip to main content
SpringerLink
Log in

PSO Combined with ILS for Flowshop-Based Parallel Task Assignment Problem

  • Conference paper
Advances in Computation and Intelligence (ISICA 2008)

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

Included in the following conference series:

Abstract

This research explores a new scheduling problem in electronics mounting assembly line: flowshop-based parallel task assignment (FSBPTA), in which the machines are lined flowingly and the tasks—including both the allocation of PCBs and their components, will be assigned to machines for mounting with the objective of minimizing the makespan. The allocation of PCBs has the characteristic of the flowshop scheduling problem (FSSP) while the assignment of the components resembles the job assignment in parallel-machine scheduling problem. To solve this problem, a hybrid algorithm method of Particle Swarm Optimization (PSO) and Iterated Local Search (ILS) is proposed. In this algorithm, ILS is used to help PSO algorithm escape from being trapped into local optima. To testify this hybrid algorithm (PSO&ILS), comparisons between PSO&ILS and PSO, PSO&ILS and multi-start descent algorithm have been advanced. Results show a 9.80% and 3.70% improvement respectively, which illustrate the effectiveness 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 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. Lenstra, J.K., Rinnooy, K.A., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–405 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ali, A., Fawaz, S., Al-Anzi: A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Computers & Operations Research 33, 1056–1080 (2006)

    Article  MATH  Google Scholar 

  3. Zhang, C., et al.: An improved particle swarm optimization algorithm for flowshop scheduling problem. Information Processing Letters 1016, 5–15 (2008)

    MathSciNet  Google Scholar 

  4. Kashan, A.H., Karimi, B.: A discrete particle swarm optimization algorithm for scheduling parallel machines. Computers & Industrial Engineering (in press, 2008)

    Google Scholar 

  5. Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 382–389. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Liu, Z., Wang, S.: Research on parallel scheduling problem based on particle swarm optimization algorithm. Computer Integrated Manufacturing Systems 12, 183–188 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ministry of Education Engineering Center of Sophisticated Electronic Equipment Manufacturing, South China University of Technology, Guangzhou, 510641, China

    Runpeng Liang, Jiaxiang Luo, Qingqiang Yang & Wenfeng Luo

Authors
  1. Runpeng Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiaxiang Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qingqiang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenfeng Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computation Center, Wuhan University, 430072, Wuhan, China

    Lishan Kang

  2. Faculty of Computer Science, China University of Geosciences, 430074, Wuhan, Hubei, P.R. China

    Zhihua Cai

  3. School of Computer Science, China University of Geosciences, Wu-Han, 430074, China Research Center for Space Science and Technology, China University of Geosciences, 430074, Wu-Han, China

    Xuesong Yan

  4. The University of Aizu, Tsuruga, Ikki-machi, 965-8580, Aizu-Wakamatsu City Fukushima, Japan

    Yong Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liang, R., Luo, J., Yang, Q., Luo, W. (2008). PSO Combined with ILS for Flowshop-Based Parallel Task Assignment Problem. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_90

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92137-0_90

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92136-3

  • Online ISBN: 978-3-540-92137-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation