Bounds for LPT Schedules on Uniform Processors

@article{Gonzalez1977BoundsFL,
  title={Bounds for LPT Schedules on Uniform Processors},
  author={Teofilo F. Gonzalez and Oscar H. Ibarra and Sartaj Sahni},
  journal={SIAM J. Comput.},
  year={1977},
  volume={9},
  pages={91-103}
}
We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.