A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
- Authors
- Kim, Hwa-joong; Lee, Dong-Ho.; Xirouchakis, P.
- Issue Date
- Oct-2006
- Publisher
- PALGRAVE MACMILLAN LTD
- Keywords
- environmental studies; production and scheduling; heuristics
- Citation
- JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.57, no.10, pp.1231 - 1240
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Volume
- 57
- Number
- 10
- Start Page
- 1231
- End Page
- 1240
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/180922
- DOI
- 10.1057/palgrave.jors.2602094
- ISSN
- 0160-5682
- Abstract
- This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.