A queueing network model for analyzing a class of branch-and-bound algorithms on a master-slave architecture

A queueing network model for analyzing a class of branch-and-bound algorithms on a master-slave architecture

0.00 Avg rating0 Votes
Article ID: iaor19931341
Country: United States
Volume: 39
Issue: 6
Start Page Number: 1005
End Page Number: 1017
Publication Date: Nov 1991
Journal: Operations Research
Authors: ,
Keywords: computers, programming: branch and bound
Abstract:

Partitioning methods lend themselves very well to implementation on parallel computers. In recent years, branch-and-bound algorithms have been tested on various types of architectures. In this paper, the authors develop a queueing network model for the analysis of a class of branch-and-bound algorithms on a master-slave architecture. The analysis is based on a fluid flow approximation. Numerical examples illustrate the concepts developed. Finally, related branch-and-bound algorithms are studied using a machine repair queueing model.

Reviews

Required fields are marked *. Your email address will not be published.