# An introduction to multiprocessor scheduling.

Qüestiió (1981)

- Volume: 5, Issue: 1, page 49-57
- ISSN: 0210-8054

## Access Full Article

top## Abstract

top## How to cite

topLenstra, 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 -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.