Publication:5501827
From MaRDI portal
zbMath1321.90051MaRDI QIDQ5501827
Gerhard J. Woeginger, Noga Alon, Yossi Azar, Tal Yadid
Publication date: 14 August 2015
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Matching with sizes (or scheduling with processing set restrictions), Matching with sizes (or scheduling with processing set restrictions), Maximizing the minimum load: the cost of selfishness, An efficient polynomial time approximation scheme for load balancing on uniformly related machines, Robust algorithms for preemptive scheduling, Online algorithms with advice for bin packing and scheduling problems, A new model for selfish routing, A tight upper bound for the \(k\)-partition problem on ideal sets, Polynomial time approximation schemes for class-constrained packing problems, Partitioning under the \(L_p\) norm, Extending Graham's result on scheduling to other heuristics, On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines, An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines, Designing PTASs for MIN-SUM scheduling problems, A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm