지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2012.11
- 수록면
- 741 - 747 (7page)
이용수
이 논문의 연구 히스토리 (13)
2016
2012
2009
2001
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
This paper considers a withdrawing and remanufacturing planning problem, in which wastes are withdrew by a container and can be remanufactured at each period by any value in the set where the rate is the capacity of a remanufacturing facility. The freight cost is proportional to the number of containers used. The multiple products are remanufactured by each taking a fixed portion (0＜ ?＜1) of the input wastes to satisfy dynamic demands of each product over a discrete and finite time horizon. Also, a start-up cost is only incurred at the first period of a remanufacturing block which is consecutively remanufactured. It is assumed that the related cost (withdrawing and inventory holding costs of the wastes, and the remanufacturing and inventory holding costs of the remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal withdrawing and remanufacturing plans that minimize the total cost to satisfy dynamic demands of the multiple products. In this paper, the optimal solution properties are characterized and then, based on these properties, a dynamic programming algorithm is presented to find the optimal plan. Also, a network model is proposed to efficiently find the optimal solution to (u,v)- subproblems.
목차
Abstract
1. 서론
2. 수리모형
3. 최적해의 성질
4. 동적계획법 알고리즘
5. 결론
참고문헌
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-530-000999422