“…Given the illustrative example in Figure 1, the process of preparing the sequence arrays is as follows. First, a path list from the disassembly diagram is selected, e.g., π = [1,4,5,9,10,13,14,17,21,22]. Next, random numbers are generated for every task; that is, π = [1:0.35,4:0.97,5:0.95,9:0.49,10:0.80,13:0.25,14:0.76,17:0.91,21:0.42,22:0.15].…”
Section: Solution Methodsmentioning
confidence: 99%
“…The main objective of DLBPs is to satisfy the demand for recovered parts using the available resources. The vast majority of the line balancing studies are focused on reducing the operational cost [17,20,21] and increasing revenue [22][23][24]. Additional operational/technical considerations and performance measures are required to improve the effectiveness and efficiency of the disassembly operations.…”
Section: Introductionmentioning
confidence: 99%
“…The authors of [21] implicitly addressed the task correlation considering their processing times but did not address the degree of task correlation as an explicit optimization criterion. Processing time is not the only operational parameter that is influenced by the degree of task correlations, an indirect approach may not be effective for addressing all of the impacts of total relatedness of the disassembly operations.…”
With growing concerns about the depletion of rare-earth elements, managing End-of-Life products has become a key sustainability initiative in the supply chains of global corporations. Recycling, the process of dismantling, separating, and recovery of components and raw materials from wastes, is technologically challenging and should be planned in such a way as to ensure operational efficiency as well as safety. This study explores the Disassembly Line Balancing Problem with Correlated Tasks (DLBP-CT), which is prevalent in the recycling of the Waste of Electrical and Electronic Equipment (WEEE). For this purpose, an original Integer Nonlinear Programming (INLP) model is proposed to find the optimal configuration for the disassembly lines. Given the NP-hard nature of this problem, the Adaptive Genetic Algorithm (AGA) is developed to solve the problem, minimizing the number of workstations and maximizing the relationship between the disassembly tasks. A case example from electronic waste is provided to test the practicality of the developed optimization approach. Sensitivity analysis is conducted to explore the impact of parameter changes in the optimization outcomes. Results are supportive of the applicability of the developed approach and show that it can serve as a strong decision aid tool when selecting the best disassembly process, workstations, and task assignments.
“…Given the illustrative example in Figure 1, the process of preparing the sequence arrays is as follows. First, a path list from the disassembly diagram is selected, e.g., π = [1,4,5,9,10,13,14,17,21,22]. Next, random numbers are generated for every task; that is, π = [1:0.35,4:0.97,5:0.95,9:0.49,10:0.80,13:0.25,14:0.76,17:0.91,21:0.42,22:0.15].…”
Section: Solution Methodsmentioning
confidence: 99%
“…The main objective of DLBPs is to satisfy the demand for recovered parts using the available resources. The vast majority of the line balancing studies are focused on reducing the operational cost [17,20,21] and increasing revenue [22][23][24]. Additional operational/technical considerations and performance measures are required to improve the effectiveness and efficiency of the disassembly operations.…”
Section: Introductionmentioning
confidence: 99%
“…The authors of [21] implicitly addressed the task correlation considering their processing times but did not address the degree of task correlation as an explicit optimization criterion. Processing time is not the only operational parameter that is influenced by the degree of task correlations, an indirect approach may not be effective for addressing all of the impacts of total relatedness of the disassembly operations.…”
With growing concerns about the depletion of rare-earth elements, managing End-of-Life products has become a key sustainability initiative in the supply chains of global corporations. Recycling, the process of dismantling, separating, and recovery of components and raw materials from wastes, is technologically challenging and should be planned in such a way as to ensure operational efficiency as well as safety. This study explores the Disassembly Line Balancing Problem with Correlated Tasks (DLBP-CT), which is prevalent in the recycling of the Waste of Electrical and Electronic Equipment (WEEE). For this purpose, an original Integer Nonlinear Programming (INLP) model is proposed to find the optimal configuration for the disassembly lines. Given the NP-hard nature of this problem, the Adaptive Genetic Algorithm (AGA) is developed to solve the problem, minimizing the number of workstations and maximizing the relationship between the disassembly tasks. A case example from electronic waste is provided to test the practicality of the developed optimization approach. Sensitivity analysis is conducted to explore the impact of parameter changes in the optimization outcomes. Results are supportive of the applicability of the developed approach and show that it can serve as a strong decision aid tool when selecting the best disassembly process, workstations, and task assignments.
“…A breadth-first search procedure finds the best and worst solution. Liu et al [18] introduced the fuzzy knowledge method to ALBP to address the problem that the distribution of task time is unknown in advance. An approximate mixed-integer second-order cone programming (MI-SOCP) model was proposed to solve the problem.…”
With the drastic change in the market, the assembly line is susceptible to some uncertainties. This study introduces the uncertain cycle time to the assembly line balancing problem (ALBP) and explores its impact. Firstly, we improve the traditional precedence graph to express the precedence, spatial, and incompatible constraints between assembly tasks, which makes ALBP more realistic. Secondly, we establish the assembly line balancing model under an uncertain cycle time, which is defined as an interval whose size can be adjusted according to the level of uncertainty. The objective of the model was to minimize the number of stations and the cycle time. Thirdly, we integrate the operator’s skill level into the model, and a multipopulation genetic algorithm is used to solve it. The method proposed in this study is verified by several test problems of different sizes. The results show that when the cycle time is uncertain, the proposed method can be used to obtain more reasonable results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.