In this paper, we consider Parallel Machines Scheduling with nonsimultaneous machine available time. We give the exact worst case performance bound of MLPT proposed by Lee. Furthermore, two other modified LPT algorith...In this paper, we consider Parallel Machines Scheduling with nonsimultaneous machine available time. We give the exact worst case performance bound of MLPT proposed by Lee. Furthermore, two other modified LPT algorithms are discussed. The paper is ended by numerical ex-periments of these algorithms.展开更多
文摘In this paper, we consider Parallel Machines Scheduling with nonsimultaneous machine available time. We give the exact worst case performance bound of MLPT proposed by Lee. Furthermore, two other modified LPT algorithms are discussed. The paper is ended by numerical ex-periments of these algorithms.
