scientific article; zbMATH DE number 3659268

MaRDI QIDQ3858002zbMATH OpenFDO

Authors Alexander H. G. Rinnooy Kan, Jan Karel Lenstra

Publication date 1980

zbMATH Keywords

approximation algorithmscomputational complexityjobsmaximum completion timemultiprocessor schedulingNP-hardnessparallel machinespolynomial algorithmpolynomial optimization algorithmsprecedence constraintspreemptiontotal completion timetutorial survey

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic scheduling theory in operations research (90B35)

Cited in

(2)

• A better lower bound for on-line scheduling
• scientific article; zbMATH DE number 640393 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858002)