Academic Journal
Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups.
| Τίτλος: | Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups. |
|---|---|
| Συγγραφείς: | Han, Hee-Jong1 (AUTHOR), Yu, Jae-Min1 (AUTHOR), Lee, Dong-Ho2 (AUTHOR) leman@hanyang.ac.kr |
| Πηγή: | International Journal of Production Research. Aug2013, Vol. 51 Issue 16, p4997-5010. 14p. 1 Color Photograph, 1 Black and White Photograph, 1 Diagram, 5 Charts, 1 Graph. |
| Θεματικοί όροι: | *Remanufacturing, *Integer programming, *Product life cycle, *Mathematical models, Disassemblers (Computer programs), Heuristic algorithms |
| Περίληψη: | This study considers selective disassembly sequencing under the sequential disassembly environment in which one component is obtained at each disassembly operation. The problem is to determine the sequence of disassembly operations to obtain multiple target components of a used or end-of-life product for the purpose of repair, reuse, remanufacturing, disposal, etc. In particular, we consider sequence-dependent setups in which setup costs depend on the disassembly operation just completed and on the operation to be processed. The problem is represented as a disassembly precedence graph and then a new integer programming model is suggested for the objective of minimising the total disassembly cost. After it is proved that the problem is NP-hard, we suggest two types of heuristics: (1) branch and fathoming algorithm for small-to-medium-sized instances; and (2) priority-rule-based algorithm for large-sized instances. A series of computational experiments, i.e., effectiveness of the new integer programming model and performances of the two heuristic types, were done on various test instances, and the results are reported. In addition, to show the applicability of the mathematical model and the solution algorithms, a case study is reported on an end-of-life electronic calculator. [ABSTRACT FROM PUBLISHER] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:bsx&genre=article&issn=00207543&ISBN=&volume=51&issue=16&date=20130815&spage=4997&pages=4997-5010&title=International Journal of Production Research&atitle=Mathematical%20model%20and%20solution%20algorithms%20for%20selective%20disassembly%20sequencing%20with%20multiple%20target%20components%20and%20sequence-dependent%20setups.&aulast=Han%2C%20Hee-Jong&id=DOI:10.1080/00207543.2013.788794 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: bsx DbLabel: Business Source Index An: 89660259 RelevancyScore: 1171 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1171.3779296875 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Han%2C+Hee-Jong%22">Han, Hee-Jong</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Yu%2C+Jae-Min%22">Yu, Jae-Min</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Lee%2C+Dong-Ho%22">Lee, Dong-Ho</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> leman@hanyang.ac.kr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Aug2013, Vol. 51 Issue 16, p4997-5010. 14p. 1 Color Photograph, 1 Black and White Photograph, 1 Diagram, 5 Charts, 1 Graph. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Remanufacturing%22">Remanufacturing</searchLink><br />*<searchLink fieldCode="DE" term="%22Integer+programming%22">Integer programming</searchLink><br />*<searchLink fieldCode="DE" term="%22Product+life+cycle%22">Product life cycle</searchLink><br />*<searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22Disassemblers+%28Computer+programs%29%22">Disassemblers (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+algorithms%22">Heuristic algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This study considers selective disassembly sequencing under the sequential disassembly environment in which one component is obtained at each disassembly operation. The problem is to determine the sequence of disassembly operations to obtain multiple target components of a used or end-of-life product for the purpose of repair, reuse, remanufacturing, disposal, etc. In particular, we consider sequence-dependent setups in which setup costs depend on the disassembly operation just completed and on the operation to be processed. The problem is represented as a disassembly precedence graph and then a new integer programming model is suggested for the objective of minimising the total disassembly cost. After it is proved that the problem is NP-hard, we suggest two types of heuristics: (1) branch and fathoming algorithm for small-to-medium-sized instances; and (2) priority-rule-based algorithm for large-sized instances. A series of computational experiments, i.e., effectiveness of the new integer programming model and performances of the two heuristic types, were done on various test instances, and the results are reported. In addition, to show the applicability of the mathematical model and the solution algorithms, a case study is reported on an end-of-life electronic calculator. [ABSTRACT FROM PUBLISHER] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=89660259 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207543.2013.788794 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 14 StartPage: 4997 Subjects: – SubjectFull: Remanufacturing Type: general – SubjectFull: Integer programming Type: general – SubjectFull: Product life cycle Type: general – SubjectFull: Mathematical models Type: general – SubjectFull: Disassemblers (Computer programs) Type: general – SubjectFull: Heuristic algorithms Type: general Titles: – TitleFull: Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Han, Hee-Jong – PersonEntity: Name: NameFull: Yu, Jae-Min – PersonEntity: Name: NameFull: Lee, Dong-Ho IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 08 Text: Aug2013 Type: published Y: 2013 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 51 – Type: issue Value: 16 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |