scientific article; zbMATH DE number 2038779

MaRDI QIDQ4449246zbMATH OpenFDO

Authors Joseph (Seffi) Naor, Hadas Shachnai, Tami Tamir

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27191123.htm

Mathematics Subject Classification ID

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

Recommendations

• Real-time scheduling with a budget
• Real-time scheduling to minimize machine busy times
• Using real time information for effective dynamic scheduling
• Real time scheduling of batch systems
• Scheduling real-time tasks for dependability
• Scheduling with time-of-use costs
• Resource cost aware scheduling

Cited in

(6)

• Cut problems in graphs with a budget constraint
• Approximating Interval Scheduling Problems with Bounded Profits
• Real-time \(k\)-bounded preemptive scheduling
• Real time scheduling with a budget: parametric-search is better than binary search
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Real-time scheduling with a budget

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