Multiple server preemptive scheduling with impatience
From MaRDI portal
Recommendations
- A sequential scheduling problem with impatient jobs
- Optimal server scheduling in nonpreemptive finite-population queueing systems
- Scheduling services in a queuing system with impatience and setup costs
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Optimal static priority rules for stochastic scheduling with impatience
Cites work
- A sequential scheduling problem with impatient jobs
- Asymptotically Optimal Admission Control of a Queue with Impatient Customers
- Call centers with impatient customers: Many-server asymptotics of the M/M/\(n+G\) queue
- Dynamic scheduling of stochastic jobs on a single machine
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- On queueing with customer impatience until the beginning of service
- On Queueing with Customer Impatience Until the End of Service
- On the optimal allocation of service to impatient tasks
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Optimal static priority rules for stochastic scheduling with impatience
- Queues with many servers and impatient customers
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Stochastic Scheduling with Release Dates and Due Dates
- The c / rule for many-server queues with abandonment
Cited in
(2)
This page was built for publication: Multiple server preemptive scheduling with impatience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358113)
