scientific article; zbMATH DE number 3744544

MaRDI QIDQ3929048zbMATH OpenFDO

Authors Eugene L. Lawler, Jan Karel Lenstra

Publication date 1981

zbMATH Keywords

deterministic schedulingexpository surveyNP-hardnessparallel machinespolynomial-time algorithmprecedence relationseries-parallel constraintssingle machinetree-like constraints

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(2)

• Rational preemptive scheduling
• Preemptive scheduling of interval orders is polynomial

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 Q3929048)