Maximizing the Throughput of Multiple Machines On-Line

DOI10.1007/11775096_6MaRDI QIDQ5434381zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1929944
• A competitive algorithm for throughput maximization on identical machines
• On maximizing the throughput of multiprocessor tasks.
• Online optimization of busy time on parallel machines
• Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
• Throughput maximization in multiprocessor speed-scaling
• Throughput Maximization in Multiprocessor Speed-Scaling
• On minimizing the total flow time on multiple machines
• Approximating the throughput of multiple machines in real-time scheduling
• Approximating the throughput of multiple machines under real-time scheduling

Cited in

(11)

• On maximizing the throughput of multiprocessor tasks.
• A competitive algorithm for throughput maximization on identical machines
• Online scheduling of bounded length jobs to maximize throughput
• Online scheduling of jobs with fixed start times on related machines
• Approximating the throughput of multiple machines in real-time scheduling
• Approximating the throughput of multiple machines under real-time scheduling
• Improved online scheduling in maximizing throughput of equal length jobs
• Online scheduling of jobs with fixed start times on related machines
• Breaking 1-1/e barrier for nonpreemptive throughput maximization
• STACS 2004
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

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)