Approximation algorithms for scheduling unrelated parallel machines
Jan Karel Lenstra, David B. Shmoys, Éva Tardos · Mathematical Programming · 1990
Cited by 935 works. doi:10.1007/bf01585745
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Linear Programming and Extensions
- Linear Programming and Extensions
- Bounds for Certain Multiprocessing Anomalies
- Theory of Linear and Integer Programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds on Multiprocessing Timing Anomalies
- Geometric Algorithms and Combinatorial Optimization
- A Greedy Heuristic for the Set-Covering Problem
- On the ratio of optimal integral and fractional covers