scientific article; zbMATH DE number 1798173

zbMATH Open0996.68503MaRDI QIDQ4553243FDOQ4553243

Authors: K. Subramani 

Publication date: 4 November 2002

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

Recommendations

• scientific article; zbMATH DE number 2080869
• scientific article; zbMATH DE number 1696503
• scientific article; zbMATH DE number 1882989
• Scheduling under linear constraints
• Real time scheduling with a budget: parametric-search is better than binary search

Mathematics Subject Classification ID

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

Cited In (7)

• An analysis of totally clairvoyant scheduling
• Real time scheduling with a budget: parametric-search is better than binary search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parametric approach to the specification and analysis of real-time scheduling based on ACSR-VP
• Network scheduling problem with cross-docking and loading constraints
• Title not available (Why is that?)

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