Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques

DOI<19::AID-JOS8>3.0.CO;2-S 10.1002/(SICI)1099-1425(199901/02)2:1<19::AID-JOS8>3.0.CO;2-SzbMath0919.90084MaRDI QIDQ1283915

K. G. Ramakrishnan, Sem C. Borst

Publication date: 26 May 1999

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

regularityquadratic assignmentheuristic algorithmsload balancingresource sharingscheduling mechanismsequi-distantlarge number of traffic classesmost-regulartemplate-driven schedulingweighted round-robin

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Computational results of an interior point algorithm for large scale linear programming
• Algorithms for generalized round robin routing
• On the duality between routing and scheduling systems with finite buffer space
• A golden ratio control policy for a multiple-access channel
• Extremal Splittings of Point Processes
• Packet delay under the golden ratio weighted TDM policy in a multiple-access channel
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Efficient visit orders for polling systems
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• Inequalities: theory of majorization and its applications

This page was built for publication: Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques