haku: @author Boxma, O. J. / yhteensä: 4
viite: 2 / 4
| Tekijä: | Boxma, O. J. Kindervater, G. A. P. |
| Otsikko: | A queuing network model for analysing a class of branch-and-bound algorithms on a master-slave architecture. |
| Lehti: | Operations Research
1991 : NOV-DEC, VOL. 39:6, p. 1005-1017 |
| Asiasana: | BRANCH AND BOUND METHODS ALGORITHMS MATHEMATICAL PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | A queueing network is developed in the paper that can be used for analysing the behaviour of a class of branch-and-bound algorithms on master-slave architectures. The main performance measures under consideration are the number of customers at the master and at the slaves. For both variants, the influence of changing the speed of the master and of the slaves, and changing of the number of slave processors are studied. 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. |
SCIMA