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

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
Suk-Chul Rim (아주대학교) Kyu-Seok Lim (아주대학교)
저널정보
대한산업공학회 대한산업공학회지 대한산업공학회지 제37권 제4호
발행연도
2011.12
수록면
289 - 296 (8page)

이용수

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

초록· 키워드

오류제보하기
In most distribution centers, products are received from the suppliers in units of pallet, stored in a rack, moved to the picking area for replenishment, picked according to customer orders, and shipped to customers. In some distribution centers, however, replenishment is made in not a whole pallet but only a portion of a pallet load, mainly due to the limited space in the order-picking area; as a result, partially loaded pallets occupy cells in the rack. As the number of slow-moving items increases, more cells are occupied by partially loaded pallets so that fewer empty cells are available for storing full, incoming pallets. This will necessitate the construction or leasing of additional storage space, which will entail significant cost. As an alternative, we propose pallet consolidation, which involves moving a partial load to another partially-loaded pallet in order to create one empty cell in the rack. In this paper, we define three pallet consolidation problems; formulate each problem as a binary integer programming model; and present heuristic algorithms for the problems. The average performance of each of the proposed heuristics is evaluated using simulation.

목차

1. Introduction
2. Literature Review
3. Pallet Consolidation Models and Heuristic Algorithms
4. Generating Q new Empty Cells(GQ)
5. Conclusions
References

참고문헌 (13)

참고문헌 신청

이 논문의 저자 정보

이 논문과 함께 이용한 논문

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2013-530-003629370