Maximizing the Throughput of Multiple Machines On-Line

DOI10.1007/11775096_6zbMATH Open1137.90497OpenAlexW1555835662MaRDI QIDQ5434381

Jaehoon Kim

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On maximizing the throughput of multiprocessor tasks.

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Throughput maximization in multiprocessor speed-scaling 👍 👎
• Online optimization of busy time on parallel machines 👍 👎
• On maximizing the throughput of multiprocessor tasks. 👍 👎
• A competitive algorithm for throughput maximization on identical machines 👍 👎
• Approximating the throughput of multiple machines in real-time scheduling 👍 👎
• Approximating the throughput of multiple machines under real-time scheduling 👍 👎
• Throughput Maximization in Multiprocessor Speed-Scaling 👍 👎
• Online Throughput Maximization on Unrelated Machines: Commitment is No Burden 👍 👎

This page was built for publication: Maximizing the Throughput of Multiple Machines On-Line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434381)