SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Se
DOI: 10.1109/icsmc.2003.1244663
|View full text |Cite
|
Sign up to set email alerts
|

Greedy algorithm for disassembly line scheduling

Abstract: -

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Publication Types

Select...
7
3

Relationship

1
9

Authors

Journals

citations
Cited by 23 publications
(10 citation statements)
references
References 8 publications
0
10
0
Order By: Relevance
“…McGovern and Gupta developed a greedy/2-Opt hybrid algorithm for the DLBP [9] and a greedy/hill climbing hybrid algorithm [10]. Kongar and Gupta applied a genetic algorithm to the disassembly sequencing problem [11].…”
Section: Literature Reviewmentioning
confidence: 99%
“…McGovern and Gupta developed a greedy/2-Opt hybrid algorithm for the DLBP [9] and a greedy/hill climbing hybrid algorithm [10]. Kongar and Gupta applied a genetic algorithm to the disassembly sequencing problem [11].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Gungor and Gupta [7] provide a comprehensive survey of issues in environmentally conscious manufacturing and product recovery. Within the area of disassembly, disassembly line has become the subject of recent interest [5], [6], [19], [22]. Korugan and Gupta [16] suggest an adaptive way of implementing kanbans to a single-stage hybrid system.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Gungor and Gupta [4] provide a comprehensive survey of issues in environmentally conscious manufacturing and product recovery. Other studies on disassembly and product recovery have been presented by Brennan et al [1], Gupta and McLean [9], Lambert [13] and McGovern and Gupta [15]. A recent book by Lambert and Gupta [14] is also helpful in understanding the areas of disassembly and disassembly modeling.…”
Section: Introductionmentioning
confidence: 97%