scientific article

zbMath0413.90028MaRDI QIDQ3048552

Fiala Tibor

Publication date: 1977

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

zbMATH Keywords

computational complexityschedulingnear optimal solutiongeneral flow-shop problemJohnson's three- machine problemNp-complete problem

Mathematics Subject Classification ID

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

Related Items

On some geometric methods in scheduling theory: A survey