구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제

• 영문명: A Batch Scheduling Problem for Jobs with Interval-typed Processing Time
• 발행기관: 한국산업경영시스템학회
• 저자명: 오세호(Se-Ho Oh)
• 간행물 정보: 『산업경영시스템학회지』제27권 제1호, 47~50쪽, 전체 4쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2004.03.01

영문 초록

This paper deals with the problem of batching and scheduling of jobs whose processing times are different respectively. But, they are given as not the exact value but the range 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.

목차

Astract

1. 서론

2. 문제의 정의

3. 해법의 개발

4. 수치예제

5. 결론

참고문헌