Optimal design of multi-server Markovian queues with polynomial waiting and service costs
From MaRDI portal
Publication:6571850
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 41026 (Why is no real title available?)
- scientific article; zbMATH DE number 3511823 (Why is no real title available?)
- A Note on Marginal Allocation in Multiple-Server Service Systems
- A Single-Server Queue with Poisson Input
- A model for rational abandonments from invisible queues
- A note on the convexity of performance measures of M/M/c queueing systems
- Analysis, Design, and Control of Queueing Systems
- Convexity results for the Erlang delay and loss formulae when the server utilization is held constant
- Coordination of staffing and pricing decisions in a service firm
- Cost Allocation and Opportunity Costs
- Cost of congestion, operational efficiency and management accounting
- Dimensioning Large Call Centers
- Homogeneous customers renege from invisible queues at random times under deteriorating waiting conditions
- Note—On the Marginal Benefit of Adding Servers to G/GI/m Queues
- Note—On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues
- On the Optimality of Single-Server Queuing Systems
- Optimal Design of Queueing Systems
- Optimal design and control of queues
- Rational abandonment from tele-queues: nonlinear waiting costs with heterogeneous preferences
- Service Competition with General Queueing Facilities
- Strong Convexity Results for Queueing Systems
- The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
- User Delay Costs and Internal Pricing for a Service Facility
This page was built for publication: Optimal design of multi-server Markovian queues with polynomial waiting and service costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571850)