&lt;title&gt;Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem&lt;/title&gt;

McGovern, Seamus M.; Gupta, Surendra M.

doi:10.1117/12.629121

Cited by 15 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In brief, the above comparisons demonstrate that the near optimal solutions generated by the proposed VNS approach surpasses the current best known solutions obtained via the single or multi objective approaches available in the literature. In other words, the solution quality of the VNS algorithm is much superior to that of, ACO (Kalayci and Gupta, 2013b;McGovern and Gupta, 2005b), multi objective ant colony optimization (MOACO) (Ding et al, 2010) , Hunter-Killer heuristic (McGovern andGupta, 2005b), RFD (Kalayci and Gupta, 2013a), TS (Kalayci and Gupta, 2013g), SA (Kalayci and Gupta, 2013e), PSO (Kalayci andGupta, 2012, 2013d), ABC (Kalayci and Gupta, 2013c;RL (Tuncel et al, 2012) algorithms. These comparison results confirm the competence of our proposed algorithm for solving the multi-objective DLBPs.…”

Section: Numerical Resultsmentioning

confidence: 99%

A variable neighbourhood search algorithm for disassembly lines

Kalaycı

Polat

Gupta

2015

Journal of Manufacturing Technology Management

Self Cite

View full text Add to dashboard Cite

Purpose – The purpose of this paper is to efficiently solve disassembly line balancing problem (DLBP) and the sequence-dependent disassembly line balancing problem (SDDLBP) which are both known to be NP-complete. Design/methodology/approach – This manuscript utilizes a well-proven metaheuristics solution methodology, namely, variable neighborhood search (VNS), to address the problem. Findings – DLBPs are analyzed using the numerical instances from the literature to show the efficiency of the proposed approach. The proposed algorithm showed superior performance compared to other techniques provided in the literature in terms of robustness to reach better solutions. Practical implications – Since disassembly is the most critical step in end-of-life product treatment, every step toward improving disassembly line balancing brings us closer to cost savings and compelling practicality. Originality/value – This paper is the first adaptation of VNS algorithm for solving DLBP and SDDLBP.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

A variable neighbourhood search algorithm for disassembly lines

Kalaycı

Polat

Gupta

2015

Journal of Manufacturing Technology Management

Self Cite

View full text Add to dashboard Cite

show abstract

“…The simple DALBP was proposed by Gungor and Gupta (2002) and has been also studied by McGovern and Gupta (2005, 2007). Heuristic and meta-heuristic algorithms were generally used in these problems.…”

Section: Disassembly Line Balancing Literaturementioning

confidence: 99%

Bi-objective optimization-based multi-criteria decision-making framework for disassembly line balancing and employee assignment problem

Deniz

Özçelik

2023

View full text Add to dashboard Cite

PurposeAlthough disassembly balancing lines has been studied for over two decades, there is a gap in the robotic disassembly. Moreover, combination of problem with heterogeneous employee assignment is also lacking. The hazard related with the tasks performed on disassembly lines on workers can be reduced by the use of robots or collaborative robots (cobots) instead of workers. This situation causes an increase in costs. The purpose of the study is to propose a novel version of the problem and to solve this bi-objective (minimizing cost and minimizing hazard simultaneously) problem.Design/methodology/approachThe epsilon constraint method was used to solve the bi-objective model. Entropy-based Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Preference Ranking Organization methods for Enrichment Evaluation (PROMETHEE) methods were used to support the decision-maker. In addition, a new criterion called automation rate was proposed. The effects of factors were investigated with full factor experiment design.FindingsThe effects of all factors were found statistically significant on the solution time. The combined effect of the number of tasks and number of workers was also found to be statistically significant.Originality/valueIn this study, for the first time in the literature, a disassembly line balancing and employee assignment model was proposed in the presence of heterogeneous workers, robots and cobots to simultaneously minimize the hazard to the worker and cost.

show abstract

“…The authors considered several performance criteria in a lexicographic order: minimise the workstation idle times, maximise the priority of removing hazardous components and maximise the priority of removing high-demand components. Two multiobjective metaheuristics, a distributed agent ant system and an uninformed deterministic search, for the design and balancing of disassembly lines were developed and compared in McGovern and Gupta (2005). Other multi-objective formulations of the DLBP were presented in McGovern and Gupta (2006), Ding et al (2010) where the objectives are also ordered lexicographically.…”

Section: Previous Workmentioning

confidence: 99%

Profit-oriented partial disassembly line design: dealing with hazardous parts and task processing times uncertainty

Bentaha

Dolgui

Battaïa

et al. 2018

International Journal of Production Research

View full text Add to dashboard Cite

This paper addresses the problem of profit-oriented disassembly line design and balancing considering partial disassembly, presence of hazardous parts and uncertainty of task processing times. Few papers have studied the stochastic disassembly line balancing problem and existing approaches have focused on heuristic and metaheuristic methods. Most existing work has concentrated on complete disassembly where task times are assumed to be normal random variables and where AND/OR graphs are not considered. The objective of this paper is the design of a serial line that obtains the maximum revenue and then balances the workload under uncertainty. The processing time of a disassembly task is assumed to be a random variable with any known probability distribution. An AND/OR graph is used to model the precedence relationships among tasks. Stochastic programming models and exact-based solution approaches combining the L-shaped algorithm and Monte Carlo sampling techniques are proposed. The relevance and applicability of the proposed models and solution methods are shown by solving efficiently a set of disassembly problem instances from the literature.

show abstract

<title>Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem</title>

Cited by 15 publications

References 10 publications

A variable neighbourhood search algorithm for disassembly lines

A variable neighbourhood search algorithm for disassembly lines

Bi-objective optimization-based multi-criteria decision-making framework for disassembly line balancing and employee assignment problem

Profit-oriented partial disassembly line design: dealing with hazardous parts and task processing times uncertainty

Contact Info

Product

Resources

About