A parallel approximation scheme for the multiprocessor scheduling problem
From MaRDI portal
Publication:1606878
DOI10.1016/S0167-8191(99)00095-2zbMath1002.90095MaRDI QIDQ1606878
Publication date: 25 July 2002
Published in: Parallel Computing (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
This page was built for publication: A parallel approximation scheme for the multiprocessor scheduling problem
