IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v33y2021i3d10.1007_s10696-020-09389-1.html
   My bibliography  Save this article

Incorporating shifting bottleneck identification in assembly line balancing problem using an artificial immune system approach

Author

Listed:
  • Mohd Nor Akmal Khalid

    (Japan Advanced Institute of Science and Technology)

  • Umi Kalsom Yusof

    (Universiti Sains Malaysia (USM))

Abstract

The manufacturing industry has evolved in the past few years due to the competitive global economy where the performance of its assembly line operations is primarily dependent upon optimum resource utilization. The assembly line operations are balanced among the available resources to obtain an equal amount of workload to achieve optimum resource utilization, called the assembly line balancing (ALB) problem. Various approaches have been proposed to solve the ALB problem, which is broadly categorized as exact, heuristic, and meta-heuristic approaches. Although solving the ALB problem is crucial, a bottleneck may still occur over the next operation stages. By using problem-specific information (bottleneck identification), it is expected to improve the solution quality of the ALB problem. As such, the contribution of this study is the computational method, namely as the swarm of immune cells with bottleneck identification (SIC+) approach, where both the ALB and bottleneck identification problems are addressed. In addition to the flexible problem representation, the SIC+ approach is equipped with a discrete bottleneck simulator to simulate the bottleneck scenario and bottleneck-specific operators to redistribute the machine workload of the identified bottleneck machine. The approach was tested on 24 benchmark data sets of the ALB problem, and the impact of incorporating bottleneck identification was illustrated. The experimental results show that the proposed SIC+ approach has achieved a total of 66.12% optimal solution over all instances of the benchmark data sets and has been compared with approaches from the literature where high-quality solutions were statistically justified.

Suggested Citation

  • Mohd Nor Akmal Khalid & Umi Kalsom Yusof, 2021. "Incorporating shifting bottleneck identification in assembly line balancing problem using an artificial immune system approach," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 717-749, September.
  • Handle: RePEc:spr:flsman:v:33:y:2021:i:3:d:10.1007_s10696-020-09389-1
    DOI: 10.1007/s10696-020-09389-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-020-09389-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10696-020-09389-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Scholl, Armin, 1995. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9690, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Audrey Cerqueus & Xavier Delorme, 2019. "A branch-and-bound method for the bi-objective simple line assembly balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 57(18), pages 5640-5659, September.
    3. Yaping Ren & Daoyuan Yu & Chaoyong Zhang & Guangdong Tian & Leilei Meng & Xiaoqiang Zhou, 2017. "An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(24), pages 7302-7316, December.
    4. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    5. Iwona Paprocka & Bożena Skołud, 2017. "A hybrid multi-objective immune algorithm for predictive and reactive scheduling," Journal of Scheduling, Springer, vol. 20(2), pages 165-182, April.
    6. Morrison, David R. & Sewell, Edward C. & Jacobson, Sheldon H., 2014. "An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset," European Journal of Operational Research, Elsevier, vol. 236(2), pages 403-409.
    7. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    8. Glock, C. H. & Jaber, M. Y., 2013. "Learning effects and the phenomenon of moving bottlenecks in a two-stage production system," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 62486, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. H. Alavidoost & M. H. Fazel Zarandi & Mosahar Tarimoradi & Yaser Nemati, 2017. "Modified genetic algorithm for simple straight and U-shaped assembly line balancing with fuzzy processing times," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 313-336, February.
    2. Bukchin, Yossi & Raviv, Tal, 2018. "Constraint programming for solving various assembly line balancing problems," Omega, Elsevier, vol. 78(C), pages 57-68.
    3. Battaïa, Olga & Dolgui, Alexandre, 2022. "Hybridizations in line balancing problems: A comprehensive review on new trends and formulations," International Journal of Production Economics, Elsevier, vol. 250(C).
    4. Eduardo Álvarez-Miranda & Jordi Pereira & Harold Torrez-Meruvia & Mariona Vilà, 2021. "A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations," Mathematics, MDPI, vol. 9(17), pages 1-19, September.
    5. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    6. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    7. Moreira, Mayron César O. & Costa, Alysson M., 2013. "Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers," International Journal of Production Economics, Elsevier, vol. 141(2), pages 552-560.
    8. García-Villoria, Alberto & Corominas, Albert & Nadal, Adrià & Pastor, Rafael, 2018. "Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints," European Journal of Operational Research, Elsevier, vol. 271(3), pages 882-895.
    9. Borba, Leonardo & Ritt, Marcus & Miralles, Cristóbal, 2018. "Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 146-156.
    10. Chica, Manuel & Bautista, Joaquín & Cordón, Óscar & Damas, Sergio, 2016. "A multiobjective model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand," Omega, Elsevier, vol. 58(C), pages 55-68.
    11. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    12. Pereira, Jordi & Ritt, Marcus, 2023. "Exact and heuristic methods for a workload allocation problem with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 309(1), pages 387-398.
    13. Marcus Ritt & Alysson M. Costa & Cristóbal Miralles, 2016. "The assembly line worker assignment and balancing problem with stochastic worker availability," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 907-922, February.
    14. Armin Scholl & Nils Boysen & Malte Fliedner, 2009. "Optimally solving the alternative subgraphs assembly line balancing problem," Annals of Operations Research, Springer, vol. 172(1), pages 243-258, November.
    15. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    16. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    17. Hager Triki & Ahmed Mellouli & Faouzi Masmoudi, 2017. "A multi-objective genetic algorithm for assembly line resource assignment and balancing problem of type 2 (ALRABP-2)," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 371-385, February.
    18. Rifat G. Ozdemir & Ugur Cinar & Eren Kalem & Onur Ozcelik, 2016. "Sub-assembly detection and line balancing using fuzzy goal programming approach," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 8(1), pages 65-86.
    19. Talip Kellegöz, 2017. "Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method," Annals of Operations Research, Springer, vol. 253(1), pages 377-404, June.
    20. Pereira, Jordi & Álvarez-Miranda, Eduardo, 2018. "An exact approach for the robust assembly line balancing problem," Omega, Elsevier, vol. 78(C), pages 85-98.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:flsman:v:33:y:2021:i:3:d:10.1007_s10696-020-09389-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.