scientific article; zbMATH DE number 2119735

zbMATH Open1093.68547MaRDI QIDQ4829010FDOQ4829010

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

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

preemptive schedule

Mathematics Subject Classification ID

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

Cited In (6)

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

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)