scientific article; zbMATH DE number 1559597
From MaRDI portal
Publication:4527046
zbMath0968.68008MaRDI QIDQ4527046
Publication date: 1 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Speed is more powerful than clairvoyance ⋮ On-line load balancing for related machines ⋮ Randomized algorithms for that ancient scheduling problem ⋮ On-line load balancing made simple: greedy strikes back ⋮ On-line algorithms for the channel assignment problem in cellular networks. ⋮ A lower bound for on-line scheduling on uniformly related machines ⋮ Semi-online scheduling with decreasing job sizes ⋮ Online scheduling with a buffer on related machines ⋮ On-line bin-stretching ⋮ An optimal online algorithm for scheduling two machines with release times ⋮ The optimal on-line parallel machine scheduling ⋮ New algorithms for related machines with temporary jobs. ⋮ Applying extra-resource analysis to load balancing. ⋮ On-line scheduling revisited ⋮ Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
This page was built for publication:
