지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
이 논문의 연구 히스토리 (13)
2016
2012
2009
2001
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
This paper considers a remanufacturing problem, in which used products(or wastes) are purchased and the used products are remanufactured to satisfy dynamic demands of remanufactured products over a discrete and finite time horizon. Also, as used products are purchased more than or equal to a special quantity Q, a discount price policy is applied. The problem assumes that the related cost (purchasing and inventory holding costs of used products, and the remanufacturing and inventory holding costs of remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal purchasing for used products and the optimal remanufacturing policies that minimize the total cost to satisfy dynamic demands of remanufactured products. This paper characterizes the properties of the optimal policy and then, based on these properties, presents a dynamic programming algorithm to find the optimal policy. Also, a network model is proposed to efficiently find the optimal solution to (u,v)-subproblems. A numerical example is then introduced to demonstrate the procedure of the proposed algorithm.
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0