Skip to main content
Log in

Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Worker assignment is a relatively new problem in assembly lines that typically is encountered in situations in which the workforce is heterogeneous. The optimal assignment of a heterogeneous workforce is known as the assembly line worker assignment and balancing problem (ALWABP). This problem is different from the well-known simple assembly line balancing problem concerning the task execution times, and it varies according to the assigned worker. Minimal work has been reported in worker assignment in two-sided assembly lines. This research studies worker assignment and line balancing in two-sided assembly lines with an objective of minimizing the cycle time (TALWABP). A mixed-integer programming model is developed, and CPLEX solver is used to solve the small-size problems. An improved migrating birds optimization algorithm is employed to deal with the large-size problems due to the NP-hard nature of the problem. The proposed algorithm utilizes a restart mechanism to avoid being trapped in the local optima. The solutions obtained using the proposed algorithms are compared with well-known metaheuristic algorithms such as artificial bee colony and simulated annealing. Comparative study and statistical analysis indicate that the proposed algorithm can achieve the optimal solutions for small-size problems, and it shows superior performance over benchmark algorithms for large-size problems.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

Download references

Acknowledgements

This research is partially supported by National Science Foundation of China under grant 61803287 and China Postdoctoral Science Foundation under grant 2018M642928.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mukund Nilakantan Janardhanan.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Janardhanan, M.N., Li, Z. & Nielsen, P. Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem. Soft Comput 23, 11263–11276 (2019). https://doi.org/10.1007/s00500-018-03684-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-018-03684-8

Keywords

Navigation