Search techniques for a nonlinear multiprocessor scheduling problem
From MaRDI portal
Publication:3319771
DOI10.1002/nav.3800290204zbMath0535.68016MaRDI QIDQ3319771
Camille C. Price, Udo W. Pooch
Publication date: 1982
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800290204
branch-and-bound algorithm; multiprocessor scheduling; zero-one quadratic programming; distributed computer network; backward shortest path labelling algorithm; directed acyclic search graph
90C20: Quadratic programming
90B40: Search theory
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
An algorithm for the multiprocessor assignment problem, Task allocation model for distributed systems
Cites Work