On the minimum number of processors for scheduling problems with communication delays

DOI10.1023/A:1018931508072zbMath0921.90094OpenAlexW201773604MaRDI QIDQ1290161

Aziz Moukrim

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018931508072

zbMATH Keywords

upper boundsmakespaninterprocessor communication delaysminimum number of processors

Mathematics Subject Classification ID

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

Related Items (2)

Minimizing the number of machines for scheduling jobs with equal processing times ⋮ Minimizing the number of machines for minimum length schedules

This page was built for publication: On the minimum number of processors for scheduling problems with communication delays