scientific article

From MaRDI portal

Publication:3869068

Jump to:navigation, search

zbMath0431.90034MaRDI QIDQ3869068

Clyde l. Monma

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity due dates precedence constraints parallel processors linear-time algorithms different due dates in-tree-problem scheduling equal-length tasks single-machine maximum lateness problem treelike precedence constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3869068&oldid=17493026"