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

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
Minsoo Kim (Pukyong National University) Woon-Seek Lee (Pukyong National University)
저널정보
대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems Vol.17 No.2
발행연도
2018.6
수록면
259 - 266 (8page)
DOI
10.7232/iems.2018.17.2.259

이용수

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

초록· 키워드

오류제보하기
This paper considers a waste collection and remanufacturing planning problem. Wastes are collected by a single container type and remanufacturing rate is any amount in the set {0,P,…, mP} where m is a nonnegative integer. Multiple products are remanufactured by each taking a fixed portion of the input wastes to satisfy dynamic demands of each product over a discrete and finite time horizon. The waste collection cost is proportional to the number of containers used. Also, a start-up cost is only incurred at the first period of consecutive remanufacturing periods. It is assumed that the related cost functions are concave and backlogging is not allowed. The objective of this paper is to simultaneously determine the optimal waste collection and remanufacturing plans that minimize the total cost. 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 for (u, v)-subproblems. Finally, the procedure for applying the proposed algorithm is illustrated by a numerical example.

목차

ABSTRACT
1. INTRODUCTION
2. THE MODEL
3. THE OPTIMAL SOLUTION PROPERTIES
4. A DYNAMIC PROGRAMMING ALGORITHM
5. A NUMERICAL EXAMPLE
6. CONCLUSION
REFERENCES

참고문헌 (16)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2018-530-003116649