Approximation algorithms for scheduling unrelated parallel machines

J.K. Lenstra, D.B. Shmoys, É. Tardos

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We consider the following problem. There are m parallel machines and n independent jobs. Each job is to be assigned to one of the machines. The processing of job j on machine i requires time P ij . The objective is to find a schedule that minimizes the makespan.
Original languageEnglish
Title of host publicationOperations Research Proceedings 1987 (Papers of the 16th Annual Meeting of DGOR, in cooperation with NSOR, Veldhoven, The Netherlands, September 23-25, 1987)
EditorsH. Schellhaas, P. Beek, van, H. Isermann, R. Schmidt, M. Zijlstra
Place of PublicationBerlin
PublisherSpringer
Pages623
ISBN (Print)3-540-19365-0
DOIs
Publication statusPublished - 1988

Fingerprint Dive into the research topics of 'Approximation algorithms for scheduling unrelated parallel machines'. Together they form a unique fingerprint.

  • Cite this

    Lenstra, J. K., Shmoys, D. B., & Tardos, É. (1988). Approximation algorithms for scheduling unrelated parallel machines. In H. Schellhaas, P. Beek, van, H. Isermann, R. Schmidt, & M. Zijlstra (Eds.), Operations Research Proceedings 1987 (Papers of the 16th Annual Meeting of DGOR, in cooperation with NSOR, Veldhoven, The Netherlands, September 23-25, 1987) (pp. 623). Berlin: Springer. https://doi.org/10.1007/978-3-642-73778-7_165