An introduction to multiprocessor scheduling.

Lenstra, J.K., and Rinnooy, A.H.G.. "An introduction to multiprocessor scheduling.." Qüestiió 5.1 (1981): 49-57. <http://eudml.org/doc/39975>.

@article{Lenstra1981,
abstract = {This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.},
author = {Lenstra, J.K., Rinnooy, A.H.G.},
journal = {Qüestiió},
keywords = {Cálculo por ordenador; Problemas combinatorios; Algoritmos polinomiales; tutorial survey; multiprocessor scheduling; computational complexity; polynomial optimization algorithms; NP-hardness; approximation algorithms; parallel machines; jobs; precedence constraints; preemption; maximum completion time; total completion time; polynomial algorithm},
language = {eng},
number = {1},
pages = {49-57},
title = {An introduction to multiprocessor scheduling.},
url = {http://eudml.org/doc/39975},
volume = {5},
year = {1981},
}

TY - JOUR
AU - Lenstra, J.K.
AU - Rinnooy, A.H.G.
TI - An introduction to multiprocessor scheduling.
JO - Qüestiió
PY - 1981
VL - 5
IS - 1
SP - 49
EP - 57
AB - This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.
LA - eng
KW - Cálculo por ordenador; Problemas combinatorios; Algoritmos polinomiales; tutorial survey; multiprocessor scheduling; computational complexity; polynomial optimization algorithms; NP-hardness; approximation algorithms; parallel machines; jobs; precedence constraints; preemption; maximum completion time; total completion time; polynomial algorithm
UR - http://eudml.org/doc/39975
ER -