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,...
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 |
Ejemplares similares
-
Lexicographic solutions for coalitional rankings
por: Algaba, Encarnación, et al.
Publicado: (2021) -
Stochastic Games with Lexicographic Reachability-Safety Objectives
por: Chatterjee, Krishnendu, et al.
Publicado: (2020) -
The State Complexity of Lexicographically Smallest Words and Computing Successors
por: Fleischer, Lukas, et al.
Publicado: (2020) -
End-Completely-Regular and End-Inverse Lexicographic Products of Graphs
por: Hou, Hailong, et al.
Publicado: (2014) -
LexicHash: sequence similarity estimation via lexicographic comparison of hashes
por: Greenberg, Grant, et al.
Publicado: (2023)