scientific article; zbMATH DE number 2119735

MaRDI QIDQ4829010zbMATH OpenFDO

Authors Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph (Seffi) Naor, Baruch Schieber, Hadas Shachnai

Publication date 29 November 2004

zbMATH Keywords

preemptive schedule

Mathematics Subject Classification ID

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

Recommendations

• Throughput maximization of real-time scheduling with batching
• Approximating the throughput of multiple machines under real-time scheduling
• Approximating the throughput of multiple machines in real-time scheduling
• Scheduling a batching machine
• Real-time scheduling with a budget

Cited in

(6)

• Approximating the throughput of multiple machines in real-time scheduling
• Scheduling Resources for Throughput Maximization
• Real-time scheduling with a budget
• Throughput maximization of real-time scheduling with batching
• Maximizing Throughput in Flow Shop Real-Time Scheduling
• Controlling job arrivals with processing time windows into batch processor buffer

This page was built for publication:

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