Task scheduling with interprocessor communication delays

DOI10.1016/0377-2217(92)90346-BzbMath0761.90057OpenAlexW2077201683MaRDI QIDQ1197669

Philippe Chrétienne

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90346-b

zbMATH Keywords

distributed memory computer schedulinginterprocessor communication delaypolynomial special cases

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

New complexity results on scheduling with small communication delays ⋮ Task scheduling with and without communication delays: A unified approach

Cites Work

• Unnamed Item
• On general routing problems

This page was built for publication: Task scheduling with interprocessor communication delays