RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING

DOI10.1142/S0129054100000144zbMath1319.68041MaRDI QIDQ5249038

Shantanu Dutt, Nihar R. Mahapatra

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

randomizationmixed-integer programmingdynamic load balancingqualitative load balancingquantitative load balancing

Mathematics Subject Classification ID

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

Cites Work

• Parallel depth first search. I: Implementation
• Solving Airline Crew Scheduling Problems by Branch-and-Cut

This page was built for publication: RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING