Multi-period disassembly levelling and lot-sizing for multiple product types with parts commonality
| Autor: | Donghyun Kim, Hyoung-Ho Doh, Dong-Ho Lee |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Engineering Mathematical optimization 021103 operations research Operations research business.industry Heuristic (computer science) Levelling Mechanical Engineering 0211 other engineering and technologies Holding cost 02 engineering and technology Extension (predicate logic) Product type Industrial and Manufacturing Engineering Sizing 020901 industrial engineering & automation business Greedy algorithm Integer programming |
| Zdroj: | Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture. 232:867-878 |
| ISSN: | 2041-2975 0954-4054 |
| DOI: | 10.1177/0954405416661001 |
| Popis: | Disassembly levelling is to determine disassembly structures that specify components to be obtained from end-of-use/life products, and disassembly lot-sizing is to determine the timing and quantity of disassembling end-of-use/life products to satisfy the demands of their components. As an extension of the previous studies that consider them separately, this study integrates the two problems, especially in the form of multi-period model. Particularly, this study considers a generalized integrated problem in which disassembly levels may be different for the products of the same type. To describe the problem mathematically, we develop an integer programming model that minimizes the sum of setup, operation and inventory holding costs. Then, due to the problem complexity, a heuristic algorithm is proposed that consists of two phases: (a) constructing an initial solution using a priority-based greedy heuristic and (b) improving it by removing unnecessary disassembly operations after characterizing the properties of the problem. To show the performance of the heuristic algorithm, computational experiments were performed on various test instances and the results are reported. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|