Publication:4952670
From MaRDI portal
zbMath0962.91001MaRDI QIDQ4952670
Todd A. Gormley, Nicholas Reingold, Eric Torng, Jeffery Westbrook
Publication date: 23 October 2000
Related Items
Tight Bounds for Online Vector Scheduling, Online Makespan Scheduling with Job Migration on Uniform Machines, Streaming algorithms for bin packing and vector scheduling, Machine covering in the random-order model, Online early work maximization on three hierarchical machines with a common due date, Semi-online scheduling revisited, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Semi-on-line multiprocessor scheduling with given total processing time, Online scheduling with rejection and withdrawal, Online scheduling with a buffer on related machines, List's worst-average-case or WAC ratio, Optimal on-line algorithms to minimize makespan on two machines with resource augmentation, Randomized priority algorithms, Resource augmentation in load balancing., Applying extra-resource analysis to load balancing., On-line scheduling revisited, A survey on makespan minimization in semi-online environments, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum, Minimizing the maximum starting time on-line, Pseudo lower bounds for online parallel machine scheduling, Scheduling In the random-order model, Online makespan scheduling with job migration on uniform machines, Tight lower bounds for semi-online scheduling on two uniform machines with known optimum, Online makespan minimization with parallel schedules, Separating online scheduling algorithms with the relative worst order ratio, Improved lower bounds for the online bin stretching problem, Approximation and online algorithms for multidimensional bin packing: a survey, On the value of job migration in online makespan minimization, Load balancing of temporary tasks in the \(\ell _{p}\) norm
