구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제
A Batch Scheduling Problem for Jobs with Interval-typed Processing Time
0
조회
0
다운로드
0
인용
0
참고문헌
초록
Abstract
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.
참고문헌 (6)
- "Amos Tuck School of Business Administration" (1998), Dartmouth College
- "Minimizing Total Completion Time on Batch Processing Machine", 31, pp.2097~2122 (1993)
- "The batch loading and scheduling problem", 49, pp.52~65 (2001)
- "Scheduling semiconductor burn-in operations to minimize total flowtime", 45, pp.874~885 (1997)
- "Efficient algorithms for scheduling semiconductor burn-in operations", pp.764~775 (1992)
- "Scheduling groups of jobs on a single machine", 43, pp.692~703 (1995)