Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 2003.05a
- /
- Pages.145-150
- /
- 2003
A PTAS for nonsimultaneous parallel machine scheduling
가용시간이 서로 다른 병렬기계 스케줄링 문제에 대한 PTAS
- Hwang Hark-Chin (Department of Industrial Engineering, Chosun University)
- 황학진 (조선대학교 산업공학과)
- Published : 2003.05.01
Abstract
The parallel machine scheduling problem or assigning n jobs on m identical machines with the objective of minimizing makespan is considered. In this note, we apply the PTAS (Polynomial Time Approximation Scheme) or Hochbaum and Shmoys to our problem and show that it is still a PTAS for our problem.
Keywords