scientific article
From MaRDI portal
Publication:3815846
zbMath0664.90044MaRDI QIDQ3815846
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityprecedence constraintsone-machine schedulingminimum maximum completion time criterion
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
This page was built for publication: