Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
From MaRDI portal
Cited in
(41)- Approximation scheduling algorithms: a survey
- A unified view of parallel machine scheduling with interdependent processing rates
- Price of anarchy of scheduling games on hierarchical machines with quadratic social cost
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
- Partitioning ideal sets
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
- Load balancing of temporary tasks in the \(\ell _{p}\) norm
- A note on the online hierarchical scheduling for l_p-norm load balancing
- Quality of move-optimal schedules for minimizing total weighted completion time
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- An asymptotically exact polynomial algorithm for equipartition problems
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Tight bounds for online vector scheduling
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
- Weighted flow time bounds for scheduling identical processors
- Tight bounds for selfish and greedy load balancing
- Frameworks for adaptable scheduling algorithms
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
- Optimal partitions
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Resource constrained scheduling as generalized bin packing
- A unified approach to truthful scheduling on related machines
- Extending Graham's result on scheduling to other heuristics
- Task allocation in fault-tolerant distributed systems
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
- On budget-constrained coverage in multi-interface networks: branchwidth and treewidth perspectives
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
- Approximation algorithms for shop scheduling problems with minsum objective
- The benefit of preemption with respect to the \(\ell_p\) norm
- A new model for selfish routing
- A dual criteria sequencing problem with earliness and tardiness penalties
- A tight upper bound for the \(k\)-partition problem on ideal sets
- Analysis of set-up time models: a metric perspective
- Tighter bounds on a heuristic for a partition problem
- Parallel machine earliness and tardiness scheduling with proportional weights
- Partitioning under the \(L_p\) norm
- A note on minimizing the sum of squares of machine completion times on two identical parallel machines
This page was built for publication: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076768)
