An approximation algorithm for scheduling on three dedicated machines

Bianco, 1991, Nonpreemptive scheduling of independent tasks with dedicated resources

Błażewicz, 1992, Scheduling multiprocessor tasks on the three dedicated processors, Inform. Process. Lett., 41, 275, 10.1016/0020-0190(92)90172-R

Błażewicz, 1992, Scheduling multiprocessor tasks on three dedicated processors, Inform. Process. Lett., 41, 275, 10.1016/0020-0190(92)90172-R

Błażewicz, 1994, Inform. Process. Lett., 49, 269, 10.1016/0020-0190(94)90066-3

Bozoki, 1970, A branch-and-bound algorithm for the continuous task-process task shop scheduling problem, AIIE Trans., 2, 246, 10.1080/05695557008974759

Coffman, 1985, Scheduling file transfers, SIAM J. Comput., 744, 10.1137/0214054

Dell'Olmo, 1993

Hoogeveen, 1992, Complexity of scheduling multiprocessor tasks with prespecified processor allocations

also: Discrete Appl. Math., to appear.

Krawczyk, 1985, An approximation algorithm for diagnostic test scheduling in multiprocessor systems, IEEE Trans. Comput., 34, 869, 10.1109/TC.1985.1676647

Kubale, 1985, The complexity of scheduling independent two-processor tasks on dedicated processors, Inform. Process. Lett., 141

Veltman, 1993, Multiprocessor scheduling with communication delays