http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
가용시간이 서로 다른 병렬기계 스케쥴링 문제에 대한 PTAS
황학진 한국경영공학회 2003 한국경영공학회지 Vol.8 No.1
The parallel machine scheduling problem of assigning jobs on machines with the objective of minimizing makespan is considered. In this note, we apply the PTAS (Polynomial Time Approximation Scheme) of Hochbaum and Shmoys to our problem and show that it is still a PTAS for our problem.
황학진 조선대학교 생산기술연구소 2005 生産技術硏究 Vol.27 No.2
For the production environment where orders come in great varieties but with small quantities, some productions occur in batch mode. In this paper, we define batching problem where each order in specified by two attributes and prove that it is NP-Complete by representing it in a bipartite graph.