An Approximation Algorithm for Scheduling on Three Dedicated Machines
暂无分享,去创建一个
[1] Bozoki George,et al. A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem , 1970 .
[2] Jacek Blazewicz,et al. Scheduling multiprocessor tasks of three dedicated processors information processing letters 41 (5) (1992) 275–280 , 1994 .
[3] B. J. Lageweg,et al. Multiprocessor scheduling with communication delays , 1990, Parallel Comput..
[4] Henryk Krawczyk,et al. An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.
[5] Edward G. Coffman,et al. Scheduling File Transfers , 1985, SIAM J. Comput..
[6] Jacek Blazewicz,et al. Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..
[7] Marek Kubale,et al. The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors , 1987, Information Processing Letters.
[8] Jacek Blazewicz,et al. Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1994, Information Processing Letters.
[9] Han Hoogeveen,et al. Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..