scientific article
From MaRDI portal
Publication:3740554
zbMath0603.90072MaRDI QIDQ3740554
S. A. Beletskij, V. Ts. Levental
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardminimum lengthapproximation polynomial-time algorithmparallel machines at each stagegeneral job shop scheduling
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
This page was built for publication:
