scientific article
From MaRDI portal
Publication:4051611
zbMath0297.68045MaRDI QIDQ4051611
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Efficient scheduling of tasks without full use of processor resources ⋮ The price of anarchy on uniformly related machines revisited ⋮ Robust algorithms for preemptive scheduling ⋮ A study of scheduling problems with preemptions on multi-core computers with GPU accelerators ⋮ Greed in resource scheduling ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Selfish load balancing for jobs with favorite machines ⋮ Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes ⋮ Tighter approximation bounds for LPT scheduling in two special cases ⋮ First fit decreasing scheduling on uniform multiprocessors ⋮ A note on on-line scheduling with precedence constraints on identical machines
This page was built for publication:
