This paper deals with the problem of batching and scheduling of jobs whose processing times are given as the duration from the lower limits to the upper, which makes it possible to group jobs into batches. The grouping of jobs is desirable because of the capability of the batch processor to accommodate several jobs at once. The time required to process the jobs in any batch depends on their lower limit processing times. Once processing is initiated on a batch processor, the batch cannot be interrupted, nor can other jobs be started. And all jobs are assumed to be simultaneously available. This paper develops the model to describe these situation and a heuristic method to minimize its total tardiness.

Abstract
 1. 서 론
 2. 문제의 정의
 3. 해법의 개발
 4. 수치예제
 5. 결 론
 참고문헌

• 오세호(청주대학교 산업정보공학과)