작업시간이 압축 가능한 경우 병렬기계의 재일정계획

• 영문명: Rescheduling on Parallel Machines with Compressible Processing Times
• 발행기관: 한국산업경영시스템학회
• 저자명: 김수환
• 간행물 정보: 『산업경영시스템학회지』제38권 제2호, 47~55쪽, 전체 9쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2015.06.30

영문 초록

This paper deals with rescheduling on unrelated parallel-machines with compressible processing times, assuming that the arrival of a set of new jobs triggers rescheduling. It formulates this rescheduling problem as an assignment problem with a side constraint and proposes a heuristic to solve it. Computational tests evaluate the efficacy of the heuristic.

목차

1. Introduction

2. Problem Definitions

3. The Linear Relaxation Heuristic

4. Computational Evaluation

5. Conclusions and Recommendations

for Future Research

키워드

Rescheduling Parallel Machines Compressible Processing Time Heuristic