Skip to main content
SpringerLink
Log in

A discrete PSO for two-stage assembly scheduling problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, a discrete particle swarm optimization (PSO) algorithm called DPSO is proposed to solve the two-stage assembly scheduling problem with respect to bicriteria of makespan and mean completion time where setup times are treated as separate from processing times. In DPSO, the particle velocity representation is redefined, and particle movement is modified accordingly. In order to refrain from the shortcoming of premature convergence, individual intensity is defined, which is used to control adaptive mutation of the particle, and mutation mode is decided by the individual fitness. Furthermore, a randomized exchange neighborhood search is introduced to enhance the local search ability of the particle and increase the convergence speed. Finally, the proposed algorithm is tested on different scale problems and compared with the proposed efficient algorithms in the literature recently. The results show that DPSO is an effective and efficient for assembly scheduling problem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Potts CN, Sevast’janov SV, Strusevich VA, Van Wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. Oper Res 43(2):346–355

    Article  MathSciNet  MATH  Google Scholar 

  2. Lee CY, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manage Sci 39(5):616–625

    Article  MATH  Google Scholar 

  3. Tozkapan A, Kirca O, Chung CS (2003) A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Oper Res 30(2):309–320

    Article  MathSciNet  MATH  Google Scholar 

  4. Allahverdi A, Al-Anzi FS (2008) The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Technol 37(1–2):166–177

    Article  Google Scholar 

  5. Sung CS, Hah K (2008) A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times. Int J Prod Econ 113(2):1038–1048

    Article  Google Scholar 

  6. Madronero MD, Peidro D, Vasant P (2010) Vendor selection problem by using an interactive fuzzy multi-objective approach with modified S-curve membership functions. Comput Math Appl 60(4):1038–1048

    Article  MathSciNet  MATH  Google Scholar 

  7. Bhattacharya A, Vasant P (2007) Soft-sensing of level of satisfaction in TOC product-mix decision heuristic using robust fuzzy-LP. Eur J Oper Res 177(1):55–70

    Article  MATH  Google Scholar 

  8. Peidro D, Vasant P (2011) Transportation planning with modified s-curve membership functions using an interactive fuzzy multi-objective approach. Appl Soft Comput 11(2):2656–2663

    Article  Google Scholar 

  9. Elamvazuthi I, Vasant P, Ganesan T (2010) Fuzzy linear programming using modified logistic membership function. Int Rev Automat Contr 3(4):370–377

    Google Scholar 

  10. Elamvazuthi I, Ganesan T, Vasant P, Webb JF (2009) Application of a fuzzy programming technique to production planning in the textile industry. Int J Comput Sci Inf Security 6(3):238–243

    Google Scholar 

  11. Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) A genetic-algorithm-based optimization model for solving the flexible assembly line balancing problem with work sharing and workstation revisiting. IEEE Trans Syst Man Cybern Part C Appl Rev 38(2):218–228

    Article  Google Scholar 

  12. Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) A genetic-algorithm-based optimization model for scheduling flexible assembly lines. Int J Adv Manuf Technol 36(1–2):156–168

    Article  Google Scholar 

  13. Amin-Naseri MR, Afshari AJ (2012) A hybrid genetic algorithm for integrated process planning and scheduling problem with precedence constraints. Int J Adv Manuf Technol 59(1–4):273–287

    Article  Google Scholar 

  14. Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41(10–11):1238–1243

    Article  MATH  Google Scholar 

  15. Arikan M, Erol S (2012) A hybrid simulated annealing-tabu search algorithm for the part selection and machine loading problems in flexible manufacturing systems. Int J Adv Manuf Technol 59(5–8):669–679

    Article  Google Scholar 

  16. Al-Anzi FS, Allahverdi A (2006) A hybrid tabu search heuristic for the two-stage assembly scheduling problem. Int J Oper Res 3(2):109–119

    MathSciNet  MATH  Google Scholar 

  17. Li JQ, Pan QK, Suganthan PN, Chua TJ (2011) 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

    Article  Google Scholar 

  18. Udhayakumar P, Kumanan S (2010) Sequencing and scheduling of job and tool in a flexible manufacturing system using ant colony optimization algorithm. Int J Adv Manuf Technol 50(9–12):1075–1084

    Article  Google Scholar 

  19. Al-Anzi FS, Allahverdi A (2009) Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. Comput Oper Res 36(9):2682–2689

    Article  MathSciNet  MATH  Google Scholar 

  20. Biswas S, Mahapatra SS (2009) Modified particle swarm optimization for solving machine-loading problems in flexible manufacturing systems. Int J Adv Manuf Technol 39(9–10):931–942

    Google Scholar 

  21. Ganesan T, Vasant P, Elamvazuthi I (2011) Optimization of nonlinear geological structure mapping using hybrid neuro-genetic techiniques. Math Comput Model 54(11–12):2913–2922

    Article  MATH  Google Scholar 

  22. Ganesan T, Vasant P, Elamvazuthi I (2011) Solving engineering optimization problems with Karush–Kuhn–Tucker Hopfield Neural Networks. Int Rev Mech Eng 5(7):1333–1339

    Google Scholar 

  23. Vasant P, Ganesan T, Elamvazuthi I (2012) Hybrid tabu search Hopfield recurrent ANN fuzzy technique to the production planning problems: a case study of crude oil in refinery industry. Int J Manuf Mater Mech Eng 2(1):47–65

    Google Scholar 

  24. Nearchou AC (2011) Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization. Int J Prod Econ 129(2):242–250

    Article  Google Scholar 

  25. Raj MV, Sankar SS, Ponnambalam SG (2012) Particle swarm optimization algorithm to maximize assembly efficiency. Int J Adv Manuf Technol 59(5–8):719–736

    Article  Google Scholar 

  26. Rashid MFF, Hutabarat W, Ashutosh T (2012) A review on assembly sequence planning and assembly line balancing optimization using soft computing approaches. Int J Adv Manuf Technol 59(1–4):335–349

    Article  Google Scholar 

  27. Moslemipour G, Lee TS, Rilling D (2012) A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems. Int J Adv Manuf Technol 60(1–4):11–27

    Article  Google Scholar 

  28. Al-Anzi FS, Allahverdi A (2007) A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. Eur J Oper Res 182(1):80–94

    Article  MathSciNet  MATH  Google Scholar 

  29. Lian ZG, Gu XS, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Chaos Soliton Fract 35(5):851–861

    Article  MATH  Google Scholar 

  30. Liu B, Wang L, Jin YH (2006) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Adv Manuf Technol 31(9–10):1001–1011

    Google Scholar 

  31. Xia WJ, Wu ZM (2006) A hybrid particle swarm optimization approach for the job-shop scheduling problem. Int J Adv Manuf Technol 29(3–4):360–366

    Article  Google Scholar 

  32. Jamili A, Shafia MA, Tavakkoli-Moghaddam R (2011) A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem. Int J Adv Manuf Technol 54(1–4):309–322

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Changchun University of Science and Technology, Changchun, 130022, China

    Ye Tian

  2. College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, 130012, China

    Dayou Liu & Kunhao Wang

  3. The First Flying College of Airforce, Harbin, 150001, China

    Donghui Yuan

Authors
  1. Ye Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dayou Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Donghui Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kunhao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ye Tian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, Y., Liu, D., Yuan, D. et al. A discrete PSO for two-stage assembly scheduling problem. Int J Adv Manuf Technol 66, 481–499 (2013). https://doi.org/10.1007/s00170-012-4343-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4343-5

Keywords

Search

Navigation