MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE
From MaRDI portal
Publication:5358113
DOI10.1017/S0269964816000176zbMath1370.90110OpenAlexW2607128671MaRDI QIDQ5358113
No author found.
Publication date: 19 September 2017
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964816000176
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Cites Work
- Call centers with impatient customers: Many-server asymptotics of the M/M/\(n+G\) queue
- On queueing with customer impatience until the beginning of service
- Dynamic scheduling of stochastic jobs on a single machine
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Optimal static priority rules for stochastic scheduling with impatience
- Queues with Many Servers and Impatient Customers
- The cμ/θ Rule for Many-Server Queues with Abandonment
- On Queueing with Customer Impatience Until the End of Service
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Stochastic Scheduling with Release Dates and Due Dates
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- A sequential scheduling problem with impatient jobs
- On the optimal allocation of service to impatient tasks
- Asymptotically Optimal Admission Control of a Queue with Impatient Customers
This page was built for publication: MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE