A Branch and Bound Algorithm for Parallel and Selective Disassembly Sequencing with Sequence-Dependent Setups
- Title
- A Branch and Bound Algorithm for Parallel and Selective Disassembly Sequencing with Sequence-Dependent Setups
- Author
- 이동호
- Keywords
- Selective disassembly sequencing; Parallel disassembly; Sequence-dependent setups; Branch and bound
- Issue Date
- 2016-06
- Publisher
- The Korean Society for Precision Engineering
- Citation
- International Symposium on Green Manufacturing and Applications (ISGMA 2016), Page. 1-6
- Abstract
- This study considers selective disassembly sequencing to obtain one or more target components of an end-of-use/life product
in parallel disassembly environment in which two or more components can be extracted at the same time by a single
disassembly operation. The problem is to determine the sequence of disassembly operations while satisfying the precedence
relationships among disassembly operations for the objective of minimizing the total disassembly operation cost. As a
practical consideration, we consider the sequence-dependent setups in which setup costs depend on the disassembly
operations just completed and on the next disassembly operations to be processed. To represent the problem mathematically,
we propose an integer programming model after representing the disassembly sequences as an extended process graph.
Then, a branch and bound algorithm is suggested that gives the optimal disassembly sequences to obtain one or more target
components. To illustrate the algorithm, a simple case study is reported.
- URI
- http://2016.isgma.org/data/2016/02-Contents%20of%20Proceedings_papers.pdfhttps://repository.hanyang.ac.kr/handle/20.500.11754/72153
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML