Add to ORKGIn this paper we examine a class of non- linear, stochastic knapsack problems which occur in manufacturing, facility or other network design ap- plications. Series, merge & split topologies of series- parallel M/M/1/K and M/M/C/K queueing networks with an overall buffer constraint bound are exam- ined. Bounds on the objective function are proposed and a sensitivity analysis is utilized to quantify the effects of buffer variations on network performance measures
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an importan...
The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with i...
The topological network design of general service, finite waiting room, multi-server queueing networ...
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, int...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, int...
The allocation of buffers between workstations is a major optimization problem faced by manufacturin...
Optimizing the performance of general finite single-server acyclic queueing networks is a challengi...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
Consulta en la Biblioteca ETSI Industriales (Riunet)[EN] This paper surveys the contributions and ap...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturi...
This paper deals with the joint optimization of the number of buffers and servers, an important issu...
International audienceThis paper deals with the joint optimization of the number of buffers and serv...
this paper, we propose a new technique for estimating the performance of queueing networks with buff...
This thesis develops exact solution methods which efficiently optimize the buffer allocation in flo...
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an importan...
The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with i...
The topological network design of general service, finite waiting room, multi-server queueing networ...
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, int...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, int...
The allocation of buffers between workstations is a major optimization problem faced by manufacturin...
Optimizing the performance of general finite single-server acyclic queueing networks is a challengi...
The optimal design of real-life systems modeled as finite queueing networks is a difficult stochasti...
Consulta en la Biblioteca ETSI Industriales (Riunet)[EN] This paper surveys the contributions and ap...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturi...
This paper deals with the joint optimization of the number of buffers and servers, an important issu...
International audienceThis paper deals with the joint optimization of the number of buffers and serv...
this paper, we propose a new technique for estimating the performance of queueing networks with buff...
This thesis develops exact solution methods which efficiently optimize the buffer allocation in flo...
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an importan...
The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with i...
The topological network design of general service, finite waiting room, multi-server queueing networ...