동적 도착의 총 납기 지연 최소화 문제

• 영문명: A Batching Problem to minimize the total Tardiness with Dynamic Arrivals
• 발행기관: 한국산업경영시스템학회
• 저자명: 오세호(Se-Ho Oh) 이근부(Keun-Boo Lee) 양희중(Hee-Joong Yang)
• 간행물 정보: 『산업경영시스템학회지』제28권 제1호, 92~96쪽, 전체 5쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2005.03.01

영문 초록

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 bum-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.

목차

Abstract

1. 서론

2. 문제의 정의

3. 해법의 개발

4. 수치 예제와 순서 결정 규칙

5. 결론

참고문헌