논문 상세보기

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

Rescheduling on Parallel Machines with Compressible Processing Times

  • 언어ENG
  • URLhttps://db.koreascholar.com/Article/Detail/319769
구독 기관 인증 시 무료 이용이 가능합니다. 4,000원
한국산업경영시스템학회지 (Journal of Society of Korea Industrial and Systems Engineering)
한국산업경영시스템학회 (Society of Korea Industrial and Systems Engineering)
초록

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
  4.1 Instance Generation
  4.2 Computational Results
 5. Conclusions and Recommendationsfor Future Research
 References
저자
  • Suhwan Kim(Department of Military Operations Research, Korea National Defense University) | 김수환 Corresponding Author