2004
DOI: 10.1117/12.516155
|View full text |Cite
|
Sign up to set email alerts
|

<title>2-opt heuristic for the disassembly line balancing problem</title>

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0
3

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 8 publications
0
29
0
3
Order By: Relevance
“…After assigning all the tasks to the workstation "table 8", it has been found that proposed heuristic requires five workstations only, those are the same as the workstations required by the heuristic proposed by McGovern and Gupta (2003), but the average idle time of the worksta- Task T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T1 Vol 12, No 3, September 2013, pp.254-263, © 2013 tions increases. It can be seen that at the 100% cycle efficiency, the proposed heuristic can reduce the cycle time by 4 seconds, and it can reach up to 36 seconds, while the heuristic proposed by McGovern and Gupta (2003) can reduce the cycle time by only one second and reach up to 39 seconds. These findings led us to conclude that the proposed heuristic performs well and improves on the results provided by the heuristic proposed by McGovern and Gupta (2003).…”
Section: Assignment Of the Tasks To The Worktationsmentioning
confidence: 97%
See 3 more Smart Citations
“…After assigning all the tasks to the workstation "table 8", it has been found that proposed heuristic requires five workstations only, those are the same as the workstations required by the heuristic proposed by McGovern and Gupta (2003), but the average idle time of the worksta- Task T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T1 Vol 12, No 3, September 2013, pp.254-263, © 2013 tions increases. It can be seen that at the 100% cycle efficiency, the proposed heuristic can reduce the cycle time by 4 seconds, and it can reach up to 36 seconds, while the heuristic proposed by McGovern and Gupta (2003) can reduce the cycle time by only one second and reach up to 39 seconds. These findings led us to conclude that the proposed heuristic performs well and improves on the results provided by the heuristic proposed by McGovern and Gupta (2003).…”
Section: Assignment Of the Tasks To The Worktationsmentioning
confidence: 97%
“…To reduce these difficulties, a MCDM based heuristic has been proposed for prioritizing and assigning the tasks to the disassembly line workstations. Three criteria have been considered for DLBP on the basis of work done by McGovern and Gupta (2003). They are as follows: 1) Part demand: Disassembly of highly demanded parts should take place at the earliest workstation(s) possible since the longer they stay in the work-piece, the higher the chance of damaging them during the disassembly process.…”
Section: Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, the parts selection of non-destructive or destructive disassembly should be optimized in terms of the recycling rate and profit. On the other hand, since the precedence relationships among disassembly tasks of the product also change with the parts selection, it is required to optimize allocation of the tasks in designing a disassembly line (Avikal et al, 2013;Aydemir-Karadag and Turkbey, 2013;Kalayci and Gupta, 2013;McGovern and Gupta, 2003). In addition, because information is required for such a design, the recycling rate, profit of each part, and disassembly task times take precedence among the disassembly tasks.…”
Section: Introductionmentioning
confidence: 99%