scientific article
From MaRDI portal
Publication:3048552
zbMath0413.90028MaRDI QIDQ3048552
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityschedulingnear optimal solutiongeneral flow-shop problemJohnson's three- machine problemNp-complete problem
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items