Scheduling malleable tasks with precedence constraints

This publication has 11 references indexed in Scilit:

• An approximation algorithm for scheduling trees of malleable tasks
  European Journal of Operational Research, 2002
• List scheduling of general task graphs under LogP
  Parallel Computing, 2000
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
  Mathematics of Operations Research, 1998
• LogP
  Communications of the ACM, 1996
• Approximate algorithms scheduling parallelizable tasks
  Published by Association for Computing Machinery (ACM) ,1992
• Generalised multiprocessor scheduling using optimal control
  Published by Association for Computing Machinery (ACM) ,1991
• Complexity of Scheduling Parallel Task Systems
  SIAM Journal on Discrete Mathematics, 1989
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
  SIAM Journal on Computing, 1989
• Complexity of Scheduling under Precedence Constraints
  Operations Research, 1978
• Bounds for Certain Multiprocessing Anomalies
  Bell System Technical Journal, 1966