• J.Berlińska,
  Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads
• T.Ebenlendr,
  Semi-Online Preemptive Scheduling: Study of Special Cases
• W.Jakob, A.Quinte, W.Süß, K.-U.Stucky,
  Fast Multi-objective Rescheduling of Grid Jobs to Constrained Resources by Heuristics and Evolution
• L.Masko, M.Tudruj, G.Mounie, D.Trystram,
  Comparison of Program Task Scheduling Algorithms for Dynamic SMP Clusters with Communication on the Fly
• P.Switalski, F.Seredynski,
  Study on GEO Metaheuristic for Solving Multiprocessor Scheduling Problem
• O.Zajíček, J.Sgall, T.Ebenlendr,
  Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput

Last modified: