Cargando…

A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors

The assembly line balancing problem (ALBP) is an eminent NP-hard topic that is discussed in mass production systems with low diversity. Primarily, two types of ALBPs are discussed in the literature as type I, which aims to find the minimum number of workstations for a given cycle time, and type II,...

Descripción completa

Detalles Bibliográficos
Autores principales: Xu, Shifu, Shavarani, Seyed Mahdi, Ghadiri Nejad, Mazyar, Vizvari, Bela, Toghraie, Davood
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9984847/
https://www.ncbi.nlm.nih.gov/pubmed/36879957
http://dx.doi.org/10.1016/j.heliyon.2023.e13925
_version_ 1784900823309877248
author Xu, Shifu
Shavarani, Seyed Mahdi
Ghadiri Nejad, Mazyar
Vizvari, Bela
Toghraie, Davood
author_facet Xu, Shifu
Shavarani, Seyed Mahdi
Ghadiri Nejad, Mazyar
Vizvari, Bela
Toghraie, Davood
author_sort Xu, Shifu
collection PubMed
description The assembly line balancing problem (ALBP) is an eminent NP-hard topic that is discussed in mass production systems with low diversity. Primarily, two types of ALBPs are discussed in the literature as type I, which aims to find the minimum number of workstations for a given cycle time, and type II, which assigns some tasks to a given number of workstations such that the maximum workstation load is minimized. To solve ALBPs, various exact, heuristic, and metaheuristic methods have been proposed. However, these methods lose their efficiency when handling large-size problems. Therefore, researchers have focused on proposing heuristic and metaheuristic algorithms to solve large-size problems, especially when they deal with real-life case problems in the industry. This study aims to present a novel and competitive exact method for solving ALBP type II based on the lexicographic order of vectors for feasible solutions. To evaluate the performance of the developed method, a group of highly used standard test problems in the literature is utilized, and the results are compared and discussed in detail. The computational results in this study specify that the developed solution approach performs efficiently and yields the best global solution of all the ALB test problems, which proves the proposed method's potential and its competitive advantage.
format Online
Article
Text
id pubmed-9984847
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-99848472023-03-05 A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors Xu, Shifu Shavarani, Seyed Mahdi Ghadiri Nejad, Mazyar Vizvari, Bela Toghraie, Davood Heliyon Research Article The assembly line balancing problem (ALBP) is an eminent NP-hard topic that is discussed in mass production systems with low diversity. Primarily, two types of ALBPs are discussed in the literature as type I, which aims to find the minimum number of workstations for a given cycle time, and type II, which assigns some tasks to a given number of workstations such that the maximum workstation load is minimized. To solve ALBPs, various exact, heuristic, and metaheuristic methods have been proposed. However, these methods lose their efficiency when handling large-size problems. Therefore, researchers have focused on proposing heuristic and metaheuristic algorithms to solve large-size problems, especially when they deal with real-life case problems in the industry. This study aims to present a novel and competitive exact method for solving ALBP type II based on the lexicographic order of vectors for feasible solutions. To evaluate the performance of the developed method, a group of highly used standard test problems in the literature is utilized, and the results are compared and discussed in detail. The computational results in this study specify that the developed solution approach performs efficiently and yields the best global solution of all the ALB test problems, which proves the proposed method's potential and its competitive advantage. Elsevier 2023-02-23 /pmc/articles/PMC9984847/ /pubmed/36879957 http://dx.doi.org/10.1016/j.heliyon.2023.e13925 Text en © 2023 The Authors https://creativecommons.org/licenses/by/4.0/This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Research Article
Xu, Shifu
Shavarani, Seyed Mahdi
Ghadiri Nejad, Mazyar
Vizvari, Bela
Toghraie, Davood
A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
title A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
title_full A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
title_fullStr A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
title_full_unstemmed A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
title_short A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
title_sort novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9984847/
https://www.ncbi.nlm.nih.gov/pubmed/36879957
http://dx.doi.org/10.1016/j.heliyon.2023.e13925
work_keys_str_mv AT xushifu anovelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT shavaraniseyedmahdi anovelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT ghadirinejadmazyar anovelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT vizvaribela anovelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT toghraiedavood anovelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT xushifu novelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT shavaraniseyedmahdi novelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT ghadirinejadmazyar novelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT vizvaribela novelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors
AT toghraiedavood novelcompetitiveexactapproachtosolveassemblylinebalancingproblemsbasedonlexicographicorderofvectors