A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture

DOI10.1287/OPRE.39.6.1005zbMath0748.90018OpenAlexW2107314984MaRDI QIDQ4006343

Onno J. Boxma, G. A. P. Kindervater

Publication date: 26 September 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.6.1005

zbMATH Keywords

machine repairqueueing network modelfluid flow approximationbranch-and-bound algorithm on a master-slave architecture

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

This page was built for publication: A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture