Article ID: | iaor1999185 |
Country: | United States |
Volume: | 45 |
Issue: | 2 |
Start Page Number: | 231 |
End Page Number: | 242 |
Publication Date: | Mar 1998 |
Journal: | Naval Research Logistics |
Authors: | Lee Chung-Yee, Li Chung-Lun, Cai Xiaoqiang |
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in