scientific article; zbMATH DE number 1445351
From MaRDI portal
Publication:4952670
zbMath0962.91001MaRDI QIDQ4952670
Todd A. Gormley, Nicholas Reingold, Eric Torng, Jeffery Westbrook
Publication date: 23 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
A survey on makespan minimization in semi-online environments ⋮ Online makespan minimization with parallel schedules ⋮ List's worst-average-case or WAC ratio ⋮ Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ 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 ⋮ Machine covering in the random-order model ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ Semi-online scheduling revisited ⋮ Tight Bounds for Online Vector Scheduling ⋮ Online scheduling with rejection and withdrawal ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Scheduling In the random-order model ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ Minimizing the maximum starting time on-line ⋮ Randomized priority algorithms ⋮ Semi-on-line multiprocessor scheduling with given total processing time ⋮ Online scheduling with a buffer on related machines ⋮ Load balancing of temporary tasks in the \(\ell _{p}\) norm ⋮ Pseudo lower bounds for online parallel machine scheduling ⋮ Streaming algorithms for bin packing and vector scheduling ⋮ Online makespan scheduling with job migration on uniform machines ⋮ Tight lower bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Resource augmentation in load balancing. ⋮ Applying extra-resource analysis to load balancing. ⋮ On-line scheduling revisited
This page was built for publication:
