The task allocation problem with constant communication.
From MaRDI portal
Publication:1408823
DOI10.1016/S0166-218X(02)00423-7zbMath1065.90037MaRDI QIDQ1408823
M. Lamari, Wenceslas Fernandez de la Vega
Publication date: 25 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Cites Work
- Optimization, approximation, and complexity classes
- An improved partial solution to the task assignment and multiway cut problems
- Geometric algorithms and combinatorial optimization
- An algorithm for the multiprocessor assignment problem
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- An efficient algorithm for a task allocation problem