scientific article
From MaRDI portal
Publication:3211101
zbMath0722.90036MaRDI QIDQ3211101
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
A survey of scheduling with controllable processing times ⋮ Scheduling with controllable release dates and processing times: Makespan minimization ⋮ Scheduling with controllable release dates and processing times: total completion time minimization
This page was built for publication:
