Upper bound on the number of processors for scheduling with interprocessor communication delays.

DOI10.1007/S001860000062zbMath1038.90036OpenAlexW2001561787MaRDI QIDQ1403166

Aziz Moukrim

Publication date: 2000

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

Full work available at URL: https://doi.org/10.1007/s001860000062

zbMATH Keywords

schedulingmakespancommunication delaysminimum number of processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Minimizing the number of machines for minimum length schedules

This page was built for publication: Upper bound on the number of processors for scheduling with interprocessor communication delays.