scientific article

zbMath0452.90034MaRDI QIDQ3899810

Alexander H. G. Rinnooy Kan, B. J. Lageweg, Eugene L. Lawler, Jan Karel Lenstra

Publication date: 1981

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

zbMATH Keywords

machine scheduling problemscomputer aided complexity classificationmaximal easy problemsmaximal open problemsminimal hard problemsminimal open problems

Mathematics Subject Classification ID

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

Related Items

An appraisal of computational complexity for operations researchers