Optimization of resource allocation in distributed production networks

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The development of the stochastic approach, based on queueing models and simulation, to optimize of resources allocation, in distributed production networks (DPN), is examined in the paper. The task of performance optimization of DPN is formulated as a non-linear integer programming problem with stochastic parameters. In our previous works, a branch and bound algorithm based on sequential use of queueing models and simulation is proposed. The analytical models are used for Lower Bound determination and choice of the optimal branching direction. The simulation is used for validation of analytical results and for computation of Upper Bound and stop condition of the algorithm. The developed methods have been used for optimization of corporate computer and telecommunication networks, High-Tech assembly manufacturing, and a printing and publishing company. In this paper, we show a new model and some additional results of simulation study for validation of models used.

Cite

CITATION STYLE

APA

Zaikin, O., Dolgui, A., & Korytkowski, P. (2002). Optimization of resource allocation in distributed production networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2296, pp. 322–331). Springer Verlag. https://doi.org/10.1007/3-540-45941-3_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free