scientific article
From MaRDI portal
Publication:3579419
zbMath1192.68095MaRDI QIDQ3579419
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (13)
Efficient coordination mechanisms for unrelated machine scheduling ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Tight bounds for selfish and greedy load balancing ⋮ Online vector scheduling and generalized load balancing ⋮ Tight Bounds for Online Vector Scheduling ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Congestion games with priority-based scheduling ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ Unnamed Item ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
This page was built for publication:
