2021
DOI: 10.1007/s10479-020-03902-3
|View full text |Cite
|
Sign up to set email alerts
|

Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(5 citation statements)
references
References 73 publications
0
5
0
Order By: Relevance
“…Items with * indicate that the objective function is normalized. Normalization function is shown in Equation (18) (Yılmaz and Yazıcı, 2022). …”
Section: Computational Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Items with * indicate that the objective function is normalized. Normalization function is shown in Equation (18) (Yılmaz and Yazıcı, 2022). …”
Section: Computational Resultsmentioning
confidence: 99%
“…On the other hand, Kucukkoc et al (2020) proposed linear and non-linear models in which the DALBP in a Type E station where many workers work. In another study, Yılmaz and Yazıcı (2022) considered teamwork and worker heterogeneity, which is an effective method in the use of time and resources, in multi-objective DALBPs. Finally, Liu et al (2022), discussed the stochastic version of the worker assignment problem with multi-model DALBP.…”
Section: Manual Disassembly Line Balancingmentioning
confidence: 99%
“…(22) Store Q step2 in the list QS step2 . ( 23) else (24) If PPD is used to describe the precedence constraints between tasks, determine the position of the shadow immediate preceding task of task i in Q step1 , denoted as pos Spre , and then insert task i at the position closest to pos mi and after pos Spre , denoted as pos insert . If the interference matrix is used to describe the precedence constraints between tasks, determine the position of the shadow immediate preceding task of task i in Q step1 in the o direction, where o is the disassembly direction of task i. pos mi is the position of task i of product m in Q step1 .…”
Section: Traditional Crowding Distance Calculation Methodmentioning
confidence: 99%
“…Given the advantages of NSGA-II, some scholars have also used it to handle disassembly line balancing problems. For example, Yılmaz et al [24] used the NSGA-II algorithm to solve disassembly line balancing problems with two diferent worker allocation strategies and achieved excellent results. Additionally, through Yılmaz et al's research, it was found that using the NSGA-II algorithm to solve DLBP requires a reasonable design of crossover and mutation operators.…”
Section: Introductionmentioning
confidence: 99%
“…At present, the research system of supply chain optimization is relatively perfect, and different studies adopt different methods to optimize the supply chain from different angles. Yılmaz et al [38] used disassembly line balance knowledge to study the multiobjective optimization problem, and finally realized the optimization of the supply chain operation process. This method is usually used for optimization in the production process.…”
Section: Introductionmentioning
confidence: 99%