scientific article

zbMath0416.90037MaRDI QIDQ3206648

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

Publication date: 1979

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

zbMATH Keywords

computational complexitydue datespreemptive schedulingmaximum latenesslinear-time algorithmnonpreemptive schedulingscheduling independent jobsNp-hardnesstwo-machine open shop

Mathematics Subject Classification ID

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

Related Items

Solving the resource constrained deadline scheduling problem via reduction to the network flow problem