Optimizing flow rates in a queueing network with side constraints
From MaRDI portal
Publication:1266636
DOI10.1016/0377-2217(94)00217-7zbMath0913.90111OpenAlexW2153123476MaRDI QIDQ1266636
Behnam Pourbabai, J. P. C. Blanc, Frank A. Van der Duyn Schouten
Publication date: 29 November 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/f771d765-609c-49d4-b5ca-b08392bd2971
labeling algorithmminimum cost network flowout-of-kilter algorithmdeterministic maximum flowstochastic queueing environment
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- A class of chance constrained network optimization problems
- Dioïds and semirings: Links to fuzzy sets and other applications
- Stochastic convexity and its applications
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Convex separable optimization is not much harder than linear optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
