scientific article

From MaRDI portal

Revision as of 21:59, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3217918

Jump to:navigation, search

zbMath0554.90056MaRDI QIDQ3217918

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra

Publication date: 1984

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

zbMATH Keywords

computational complexity machine scheduling parallel machines single machine partial order maximum completion time total tardiness chain-like precedence constraints unit-time jobs

Mathematics Subject Classification ID

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

Related Items (4)

Preemptive scheduling of interval orders is polynomial ⋮ On the complexity of generalized due date scheduling problems ⋮ Minimizing the number of tardy jobs in single machine sequencing ⋮ New directions in scheduling theory

This page was built for publication:

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