scientific article; zbMATH DE number 6472625

zbMath1321.90051MaRDI QIDQ5501827

Tal Yadid, Gerhard J. Woeginger, Noga Alon, Yossi Azar

Publication date: 14 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (29)

A note on minimizing the sum of squares of machine completion times on two identical parallel machines ⋮ New Algorithmic Results for Bin Packing and Scheduling ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Approximation schemes for the generalized extensible bin packing problem ⋮ Polynomial time approximation schemes for class-constrained packing problems ⋮ Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines ⋮ A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Breaking symmetries to rescue sum of squares in the case of makespan scheduling ⋮ A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm ⋮ Unnamed Item ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Robust algorithms for preemptive scheduling ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines ⋮ A new model for selfish routing ⋮ Parallel machine scheduling with speed-up resources ⋮ Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Unnamed Item ⋮ 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 ⋮ Partitioning under the \(L_p\) norm ⋮ A tight upper bound for the \(k\)-partition problem on ideal sets ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines ⋮ Extending Graham's result on scheduling to other heuristics

This page was built for publication: