scientific article
From MaRDI portal
Publication:3761689
zbMath0623.68033MaRDI QIDQ3761689
David B. Shmoys, Dorit S. Hochbaum
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingpolynomial approximation schememinimum makespan problemdual approximation approachfamily of polynomial-time algorithmsuniform parallel processors
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Tight FPT approximation for socially fair clustering ⋮ Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
This page was built for publication: