scientific article

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 complexitymachine schedulingparallel machinessingle machinepartial ordermaximum completion timetotal tardinesschain-like precedence constraintsunit-time jobs

Mathematics Subject Classification ID

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

Related Items

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