Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 2006.11a
- /
- Pages.281-283
- /
- 2006
Worst Case Analysis of Tree Algorithm for Minimum Batch Cover Problem
단위작업 편성 문제의 Worst Case 분석
- Published : 2006.11.17
Abstract
In this paper, we consider the problem of batch processing of orders, where either a single order or a pair of orders which satisfies specific conditions may be grouped in the same batch. The objective of the problem is to minimize the number of batches formed to accommodate all orders. We prose an approach based on a Known algorithm proven to be optimal for special class of problems with tree structure and show the approach to have the worst case ratio of
Keywords