동적 도착의 총 납기 지연 최소화 문제
A Batching Problem to minimize the total Tardiness with Dynamic Arrivals
0
조회
0
다운로드
2
인용
0
참고문헌
초록
Abstract
This paper deals with a batch processor model in which the batch processing times depend on the jobs assigned to the batch. Each job has a distinct processing time which is determined as not the exact value but the range from the lower limit to the upper, which makes it possible to group several jobs into the same batch. In point of this flexibility our model can be referred to as the generalization of the burn-in model in which the upper limit of each job is unbounded. The jobs to be scheduled may be available nonsimultaneously. Therefore they have different ready times. We develop the model to describe the problem situation and the heuristic methods to minimize the total tardiness. And our batching rule is compared with other dispatching ones.
참고문헌 (7)
- 오세호, "구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제", 27(1), pp.47~50 (2004)
- Ahmed, "Due Date Assignment, Job Order Release and Sequencing", 23, pp.633~644 (1992)
- K. R. Baker, "Elements of Sequencing and Scheduling Amos Tuck School of Business Administration" (1998)
- V. Chandru,C.Y. Lee, "Minimizing Total Completion Time on Batch Processing Machine", 31, pp.2097~2122 (1993)
- G. R. Dobson,R. S. Nambimadom, "The Batch Loading and Scheduling Problem", 49, pp.52~65 (2001)
- D. S. Hochbaum, "Scheduling semiconductor burn-in operations to minimize total flowtime", 45, pp.874~885 (1997)
- C. Y. Lee, "Efficient algorithms for scheduling semiconductor burn-in operations", pp.764~775 (1992)