Pages that link to "Item:Q2483503"
From MaRDI portal
The following pages link to Buffer allocation in general single-server queueing networks (Q2483503):
Displaying 28 items.
- Two approaches for solving the buffer allocation problem in unreliable production lines (Q336569) (← links)
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
- A Fokker-Planck equation method predicting buffer occupancy in a single queue (Q878744) (← links)
- Performance analysis of wireless sensor networks using queuing networks (Q889531) (← links)
- Topological network design of general, finite, multi-server queueing networks (Q1037668) (← links)
- Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization (Q1040957) (← links)
- Deadlock free buffer allocation in closed queueing networks (Q1115027) (← links)
- Machine allocation problems in manufacturing networks (Q1262201) (← links)
- Buffer allocation optimization in ATM switching networks using ALOPEX algorithm (Q1286498) (← links)
- On adaptive allocation of the buffer memory of a packet switching node (Q1290693) (← links)
- Allocation of buffer capacities in queueing networks with arbitrary topologies (Q1315349) (← links)
- Buffer allocation for an integer nonlinear network design problem (Q1362945) (← links)
- Combining routing and buffer allocation problems in series-parallel queueing networks (Q1424895) (← links)
- Efficient storage allocation for processing in backlog-controlled queueing networks using multicriteria techniques (Q1578001) (← links)
- Modeling and optimization of buffers and servers in finite queueing networks (Q1735967) (← links)
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
- Buffer allocation for a class of nonlinear stochastic knapsack problems (Q1904725) (← links)
- Optimal buffer allocation in tandems of last come first served queues (Q1915950) (← links)
- Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers (Q1955082) (← links)
- Server allocation for zero buffer tandem queues (Q2356030) (← links)
- Performance optimization of open zero-buffer multi-server queueing networks (Q2379658) (← links)
- Optimal buffer allocation in finite closed networks with multiple servers (Q2471231) (← links)
- A continuous buffer allocation model using stochastic processes (Q2630233) (← links)
- Optimizing the throughput, service rate, and buffer allocation in finite queueing networks (Q2840535) (← links)
- Optimal server allocation in general, finite, multi-server queueing networks (Q3103174) (← links)
- Buffer and server allocation in general multi-server queueing networks (Q3563626) (← links)
- Buffer Behavior with Poisson Arrivals and Bulk Geometric Service (Q4119936) (← links)
- Optimization of buffer allocation in unreliable production lines based on availability evaluation (Q4563354) (← links)