Multiprocessor scheduling with machine allotment and parallelism constraints

DOI10.1007/S00453-001-0098-3zbMath1009.68014OpenAlexW63422819MaRDI QIDQ1348915

Tami Tamir, Hadas Shachnai

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0098-3

zbMATH Keywords

makespanmultiprocessor scheduling problemmachine allotments

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Tight bounds for online class-constrained packing ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ A note on dual approximation algorithms for class constrained bin packing problems

This page was built for publication: Multiprocessor scheduling with machine allotment and parallelism constraints