메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학술저널
저자정보
저널정보
한국경영공학회 한국경영공학회지 한국경영공학회지 제16권 제3호
발행연도
2011.1
수록면
261 - 274 (14page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색

이 논문의 연구 히스토리 (13)

초록· 키워드

오류제보하기
This paper considers a remanufacturing planning problem, in which the used products(or wastes) are purchased and the used products can be remanufactured at each period by any value in the set where the rate is the capacity of a remanufacturing facility. The remanufactured products are used to satisfy dynamic demands 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 (purchasing and inventory holding costs of the used products, 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 purchasing plan for the used products and the optimal remanufacturing plan that minimize the total cost to satisfy dynamic demands of the remanufactured 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. A numerical example is introduced to demonstrate the procedure of the proposed algorithm.

목차

등록된 정보가 없습니다.

참고문헌 (23)

참고문헌 신청

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0