scientific article
From MaRDI portal
Publication:3824093
zbMath0671.90036MaRDI QIDQ3824093
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
NP-hardness of shop-scheduling problems with three jobs, The complexity of shop-scheduling problems with two or three jobs, Complexity of shop-scheduling problems with fixed number of jobs: a survey
