scientific article; zbMATH DE number 1445351

MaRDI QIDQ4952670zbMATH OpenFDO

Authors Todd A. Gormley, Nicholas Reingold, Eric Torng, Jeffery R. Westbrook

Publication date 23 October 2000

zbMATH Keywords

adversary request nodesadversary strategiesgame treesonline move nodesrequest-answer games

Mathematics Subject Classification ID

Linear programming (90C05) 2-person games (91A05) Noncooperative games (91A10)

Cited in

(34)

• 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
• 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
• Load balancing of temporary tasks in the \(\ell _{p}\) norm
• Semi-online scheduling revisited
• Tight bounds for online vector scheduling
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Online Makespan Scheduling with Job Migration on Uniform Machines
• Semi-on-line multiprocessor scheduling with given total processing time
• 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
• Online scheduling with rejection and withdrawal
• Online early work scheduling on parallel machines
• Scheduling in the random-order model
• Online two-dimensional load balancing
• Semi-online multiprocessor scheduling with known largest job processing time
• Semi-online scheduling with non-increasing job sizes and a buffer
• Online scheduling with a buffer on related machines
• Online scheduling with rejection revisited
• Online speed-robust scheduling
• List's worst-average-case or WAC ratio
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
• Randomized priority algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952670)