지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
We consider a problem of grouping orders for batch processing that arises in production systems where customer orders are processed in batches. This problem can be viewed as a variant of bin packing problem where items can be spilt and a pair of items can be placed in a bin when the items are compatible with each other. In this paper, we consider a special case that at most two different items can be placed in a single bin and the size of every item is at most the size of a bin.
목차
Abstract
1. 서론
2. 용어의 정의와 문제의 복잡성
3. 근사비율 1.5의 온라인해법
4. 결론
참고문헌
참고문헌 (14)
참고문헌 신청
1. [학술지(정기간행물)] - Chang, J / 2011 / Approximation of a batch consolidation problem / Networks 59 : 12 ~ 19
2. [학술지(정기간행물)] - Chen, M / 2007 / Some approximation algorithms for the chlique partition problem in weigehted interval graphs / Theoretical Computer Science 381 : 124 ~ 133
3. [학술지(정기간행물)] - Chung, F.R / 2006 / Parallelism versus memory allocation in pipelined router forwarding engines / Theory of Computing systems 39 : 829 ~ 849
4. [학술지(정기간행물)] - Epstein, L / 2008 / On bin packing with conflicts / SIAM J. Optimization 19 : 1270 ~ 1285
5. [학술지(정기간행물)] - Epstein, L / 2011 / Improved results for a memory allocation problem / Theory of Computing Systems 48 (1) : 79 ~ 92
2. [학술지(정기간행물)] - Chen, M / 2007 / Some approximation algorithms for the chlique partition problem in weigehted interval graphs / Theoretical Computer Science 381 : 124 ~ 133
3. [학술지(정기간행물)] - Chung, F.R / 2006 / Parallelism versus memory allocation in pipelined router forwarding engines / Theory of Computing systems 39 : 829 ~ 849
4. [학술지(정기간행물)] - Epstein, L / 2008 / On bin packing with conflicts / SIAM J. Optimization 19 : 1270 ~ 1285
5. [학술지(정기간행물)] - Epstein, L / 2011 / Improved results for a memory allocation problem / Theory of Computing Systems 48 (1) : 79 ~ 92
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-320-003164783