Optimal parallel processing of random task graphs
From MaRDI portal
Publication:5939271
DOI10.1002/jos.70zbMath1017.90050MaRDI QIDQ5939271
Publication date: 27 August 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.70
flowtime; makespan; stochastic scheduling; parallel processing; precedence constraints; random task graph
90B36: Stochastic scheduling theory in operations research
Cites Work