Achieving Quasi-Complete Balance in U-shaped Assembly Lines Using Idle Time Elimination Methodologies
Main Article Content
Keywords
Layout, U-shaped line balancing, OAUB, LDUB, idle time elimination, production efficiency
Abstract
The problem of balancing the U-shaped production line is a well-known NP-problem in mass production, where the main objective is to allocate tasks efficiently to the workstations while minimising idle time and balancing the workload throughout the production line. The study introduces two new methods to address these issues and increase the efficiency of line balancing: Operators Arrangement for U-shaped line Balancing (OAUB) and Layout Design for U-shaped line Balancing (LDUB). OAUB optimizes the allocation of workers by strategically adjusting the assignment of tasks, ensuring that idle time is minimised and that the use of workers is maximised. By contrast, LDUB alleviates idle time by filling in the gaps between tasks with independent, low-processing tasks from non-critical paths, thus ensuring a more efficient use of available time during the transitions. Implementation of these methods has shown promising results and significantly reduced the idle time of the production processes. Specifically, OAUB achieved a reduction of only 0.9 units of idle time, while LDUB decreased idle time by 3 units. These results are particularly important from a sustainability point of view, as they contribute to reducing waste through better use of resources and increased production efficiency. Unlike traditional approaches, which are mainly focused on minimizing the number of workstations or the reduction of cycle times, our methodology provides a more integrated approach to balancing the workload between workstations. The practical implications of these methods are significant as they are applicable to the real-world production environment and offer effective and efficient solutions to achieve near complete alignment on U-shaped assembly lines, thus improving overall productivity and sustainability in an environment of mass production.
References
[2]M. Oksuz, K. Buyukozkan, and S. Satoglu, “U-shaped assembly line worker assignment and balancing problem: A mathematical model and two meta-heuristics,” Computers & Industrial Engineering, vol. 112, pp. 246–263, 2017, doi: 10.1016/j.cie.2017.08.030.
[3]G. J. Miltenburg and J. Wijngaard, “The U-line line balancing problem,” Management Science, vol. 40, no. 10, pp. 1378–1388, 1994, doi: 10.1287/mnsc.40.10.1378.
[4]A. L. Gutjahr and G. L. Nemhauser, “An algorithm for the line balancing problem,” Management Science, vol. 11, no. 2, pp. 308–315, 1964, doi: 10.1287/mnsc.11.2.308.
[5]D. Sparling and J. Miltenburg, “The mixed-model U-line balancing problem,” International Journal of Production Research, vol. 36, no. 2, pp. 485–501, 1998, doi: 10.1080/002075498193859.
[6]T. L. Urban, “Optimal balancing of U-shaped assembly lines,” Management Science, vol. 44, no. 5, pp. 738–741, 1998, doi: 10.1287/mnsc.44.5.738.
[7]J. L. Hartnett, D. H. Kropp, and K. Suzaki, “The new manufacturing challenge: Techniques for continuous improvement,” Academy of Management Review, vol. 13, no. 3, p. 500, 1988, doi: 10.2307/258098.
[8]C.-H. Cheng, J. Miltenburg, and J. Motwani, “The effect of straight- and U-shaped lines on quality,” IEEE Transactions on Engineering Management, vol. 47, no. 3, pp. 321–334, 2000, doi: 10.1109/17.865901.
[9][9] R. J. Schonberger and E. M. Knod, Operations Management: Continuous Improvement, 5th ed., Burr Ridge, IL, USA: Irwin Professional Publishing, 1994.
[10]J. Miltenburg, “Balancing U-lines in a multiple U-line facility,” European Journal of Operational Research, vol. 109, no. 1, pp. 1–23, 1998, doi: 10.1016/S0377-2217(97)00169-0.
[11]F. Guerriero and J. Miltenburg, “The stochastic U-line balancing problem,” Naval Research Logistics, vol. 50, no. 1, pp. 31–57, 2003, doi: 10.1002/nav.10043.
[12]E. Erel, I. Sabuncuoglu, and H. Sekerci, “Stochastic assembly line balancing using beam search,” International Journal of Production Research, vol. 43, no. 7, pp. 1411–1426, 2005, doi: 10.1080/00207540412331320526.
[13]H. Gökçen and K. Ağpak, “A goal programming approach to simple U-line balancing problem,” European Journal of Operational Research, vol. 171, no. 2, pp. 577–585, 2006, doi: 10.1016/j.ejor.2004.09.021.
[14]B. Toklu and U. Özcan, “A fuzzy goal programming model for the simple U-line balancing problem with multiple objectives,” Engineering Optimization, vol. 40, no. 3, pp. 191–204, 2008, doi: 10.1080/03052150701651642.
[15]G. Widyadana, “Multi-objective model for balancing U-type assembly line with permanent and temporary workers,” Teknologi Industri, vol. 11, no. 1, pp. 33–42, 2009, doi: 10.9744/jti.11.1.33-42.
[16]M. Yegul, K. Agpak, and M. Yavuz, “A new algorithm for U-shaped two-sided assembly line balancing,” Transactions of the Canadian Society for Mechanical Engineering, vol. 34, no. 2, pp. 225–241, 2010, doi: 10.1139/tcsme-2010-0014.
[17]I. Kucukkoc and D. Z. Zhang, “Balancing of parallel U-shaped assembly lines,” Computers & Operations Research, vol. 64, pp. 233–244, 2015, doi: 10.1016/j.cor.2015.05.014.
[18]P. Sivasankaran and P. Shahabudeen, “Literature review of assembly line balancing problems,” International Journal of Advanced Manufacturing Technology, vol. 73, nos. 9–12, pp. 1665–1694, 2014, doi: 10.1007/s00170-014-5944-y.
[19]D. A. Ajenblit and R. L. Wainwright, “Applying genetic algorithms to the U-shaped assembly line balancing problem,” in Proc. IEEE Int. Conf. Evolutionary Computation, Anchorage, AK, USA, 1998, pp. 96–101, doi: 10.1109/ICEC.1998.699329.
[20]Y. K. Kim, J. Y. Kim, and Y. Kim, “An endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed-model U-lines,” European Journal of Operational Research, vol. 168, no. 3, pp. 838–852, 2006, doi: 10.1016/j.ejor.2004.07.032.
[21]S. Avikal, R. Jain, P. K. Mishra, and H. C. Yadav, “A heuristic approach for U-shaped assembly line balancing to improve labor productivity,” Computers & Industrial Engineering, vol. 64, no. 4, pp. 895–901, 2013, doi: 10.1016/j.cie.2013.01.001.
[22]J. M. Nilakantan and S. Ponnambalam, “Robotic U-shaped assembly line balancing using particle swarm optimization,” Engineering Optimization, vol. 48, no. 2, pp. 231–252, 2016, doi: 10.1080/0305215X.2014.998664.
[23]Z. Li, M. Janardhanan, Q. Tang, and Z. Zhang, “Models and algorithms for U-shaped assembly line balancing problem with collaborative robots,” Soft Computing, vol. 27, no. 14, pp. 9639–9659, 2023, doi: 10.1007/s00500-023-08130-y.
[24]B. Zhang, L. Xu, and J. Zhang, “Balancing and sequencing problem of mixed-model U-shaped robotic assembly line: Mathematical model and dragonfly algorithm-based approach,” Applied Soft Computing, vol. 98, Art. no. 106739, 2020, doi: 10.1016/j.asoc.2020.106739.
[25]Z. Mao, Y. Sun, K. Fang, D. Huang, and J. Zhang, “Balancing and scheduling of assembly line with multi-type collaborative robots,” International Journal of Production Economics, vol. 271, Art. no. 109207, 2024, doi: 10.1016/j.ijpe.2024.109207.
[26]A. Nourmohammadi, M. Fathi, and A. H. C. Ng, “Balancing and scheduling human–robot collaborated assembly lines with layout and objective consideration,” Computers & Industrial Engineering, vol. 187, Art. no. 109775, Feb. 2024, doi: 10.1016/j.cie.2023.109775.
[27]A. Nourmohammadi, T. Arbaoui, M. Fathi, and A. Dolgui, “Balancing human–robot collaborative assembly lines: A constraint programming approach,” Computers & Industrial Engineering, vol. 205, Art. no. 111154, Jul. 2025, doi: 10.1016/j.cie.2025.111154.
[28]L. Tiacci, “Mixed-model U-shaped assembly lines: Balancing and comparing with straight lines with buffers and parallel workstations,” Journal of Manufacturing Systems, vol. 45, pp. 286–305, 2017, doi: 10.1016/j.jmsy.2017.07.005.
[29]E. Álvarez-Miranda and J. Pereira, “On the complexity of assembly line balancing problems,” Computers & Operations Research, vol. 108, pp. 182–186, 2019, doi: 10.1016/j.cor.2019.04.005.
[30][30] A. Fattahi, S. Elaoud, E. Sadeqi Azer, and M. Turkay, “A novel integer programming formulation with logic cuts for the U-shaped assembly line balancing problem,” International Journal of Production Research, vol. 52, no. 5, pp. 1318–1333, 2014, doi: 10.1080/00207543.2013.832489.
[31]A. Lester, Project Management, Planning and Control: Managing Engineering, Construction and Manufacturing Projects to PMI, APM and BSI Standards, 7th ed., Oxford, U.K.: Elsevier, 2017.
[32]J. R. Jackson, “A computing procedure for a line balancing problem,” Management Science, vol. 2, no. 3, pp. 261–271, 1956, doi: 10.1287/mnsc.2.3.261.
Article Sidebar
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright Ownership
- Authors who publish their articles in Jurnal Optimasi Sistem Industri (JOSI) retain full copyright of their work.
- JOSI does not require authors to transfer their copyright to the journal or its publisher, Universitas Andalas. The authors grant JOSI a license for first publication.
All articles published in Jurnal Optimasi Sistem Industri (JOSI) are licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) license.
This means that users are free to:
- Share — copy and redistribute the material in any medium or format.
- Adapt — remix, transform, and build upon the material.
Under the following terms:
- Attribution (BY): You must give appropriate credit to the author(s) and JOSI as the original source of publication (including the article title, author(s) names, journal name, volume, issue, page numbers, year, and DOI), provide a link to the CC BY-NC-SA 4.0 license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- NonCommercial (NC): You may not use the material for commercial purposes.
- ShareAlike (SA): If you remix, transform, or build upon the material, you must distribute your contributions under the same CC BY-NC-SA 4.0 license as the original.
A link to the full license text should also be provided: https://creativecommons.org/licenses/by-nc-sa/4.0/
