
Verriet, J.H. (2000). Scheduling outtrees of height one in the {LogP} model. Parallel Computing, 26, 1065-1082. Verriet, J.H. (2000). Scheduling tree-like task systems with non-uniform deadlines subject to unit-leng communication delays. Discrete Applied Mathematics, 101, 269-289. Verriet, J.H. (1999). Scheduling interval-ordered tasks with non-uniform deadlines subject to nonzero communication delays. Parallel Computing, 25, 3-21. Verriet, J.H. (1998). Scheduling outtrees of height one in the LogP model. (UU-CS1998-24 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Verriet, J.H. (1998, June 10). Scheduling with communication for multi-processor computation. Utrecht University (Utrecht, the Netherlands: Utrecht University). Prom./coprom.: prof. dr. J. van Leeuwen. Verriet, J.H. (1998). The complexity of scheduling typed task systems with and without communication delays. (UU-CS1998-26 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Verriet, J.H. (1997). Scheduling tree-structured programs in the LogP model. (UU-CS1997-18 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Verriet, J.H. (1997). The complexity of scheduling graphs of bounded width subject to non-zero communication delays. (UU-CS1997-01 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Verriet, J.H. (1996). Scheduling interval ordered tasks with non-uniform deadlines. In T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano & S. Suri (Eds.), Proceedings of the 7th International Symposium on Algorithms and Computing (pp. 366-375). Berlin, Germany: Springer-Verlag. Verriet, J.H. (1996). Scheduling interval orders with release dates and deadlines. (UU-CS1996-12 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Verriet, J.H. (1995). Scheduling UET, UCT dags with release dates and deadlines. (UU-CS1995-31 ). Utrecht: Utrecht University.