# Santa Claus schedules jobs on unrelated machines

@article{Svensson2011SantaCS, title={Santa Claus schedules jobs on unrelated machines}, author={Ola Svensson}, journal={ArXiv}, year={2011}, volume={abs/1011.1168} }

One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines, i.e., job j requires time pij if processed on machine i. More than two decades after its introduction it is still the algorithm of choice even in the restricted model where processing times are of the form pij ∈ pj, ∞. This problem, also known as the restricted assignment problem, is NP-hard to approximate… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 63 CITATIONS, ESTIMATED 93% COVERAGE

## Strong LP formulations for scheduling splittable jobs on unrelated machines

VIEW 2 EXCERPTS

CITES BACKGROUND

## On the Configuration-LP of the Restricted Assignment Problem

VIEW 2 EXCERPTS

CITES BACKGROUND

## On (1, ∊)-Restricted Assignment Makespan Minimization

VIEW 9 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Tighter Bounds for Makespan Minimization on Unrelated Machines

VIEW 6 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Minimizing General Delay Costs on Unrelated Machines

VIEW 2 EXCERPTS

CITES BACKGROUND

## Approximation Algorithms for Problems in Makespan Minimization on Unrelated Parallel Machines

VIEW 1 EXCERPT

CITES METHODS

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**10**Highly Influenced Citations**Averaged 6 Citations**per year from 2018 through 2020

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES

## On allocations that maximize fairness

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## An optimal rounding gives a better approximation for scheduling unrelated machines

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## The Santa Claus problem

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL