Publication:5501827
From MaRDI portal
zbMath1321.90051MaRDI QIDQ5501827
Tal Yadid, Gerhard J. Woeginger, Noga Alon, Yossi Azar
Publication date: 14 August 2015
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Unnamed Item, New Algorithmic Results for Bin Packing and Scheduling, Matching with sizes (or scheduling with processing set restrictions), Matching with sizes (or scheduling with processing set restrictions), A survey of offline algorithms for energy minimization under deadline constraints, A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines, 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, Approximation schemes for the generalized extensible bin packing problem, 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, Parallel machine scheduling with speed-up resources, Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games, Semidefinite and linear programming integrality gaps for scheduling identical machines, Breaking symmetries to rescue sum of squares in the case of makespan scheduling, On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines, A note on minimizing the sum of squares of machine completion times on two identical parallel machines, An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines, Designing PTASs for MIN-SUM scheduling problems, A Unified Approach to Truthful Scheduling on Related Machines, Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines, Closing the Gap for Makespan Scheduling via Sparsification Techniques, A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
