An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension

DOI10.1016/S0304-3975(96)00282-4zbMath0901.68015MaRDI QIDQ1391539

Y. Kopidakis, Vassilios Zissimopoulos

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

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

Related Items

An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems

Cites Work

• Unnamed Item
• Preemptive scheduling of independent jobs on a hypercube
• Bin packing can be solved within 1+epsilon in linear time
• An approximation scheme for strip packing of rectangles with bounded dimensions
• Bin packing with restricted piece sizes