Service Scheduling for Random Requests with Fixed Waiting Costs
We study service scheduling problems in a slotted system in which agents arrive with service requests according to a Bernoulli process and have to leave within two slots after arrival, service costs are quadratic in service rates, and there are also waiting costs. We consider fixed waiting costs. We frame the problems as average cost Markov decision processes. While the studied system is a linear system with quadratic costs, it has state dependent control. Moreover, it also possesses a non-standard cost function structure in the case of fixed waiting costs, rendering the optimization problem complex. Here, we characterize optimal policy. We also consider a system in which the agents make scheduling decisions for their respective service requests keeping their own cost in view. We again consider fixed waiting costs and frame this scheduling problem as a stochastic game. Here, we provide Nash equilibrium.
Code (0)
등록된 구현이 없습니다.
Tasks
SchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Service Scheduling for Random Requests with Quadratic Waiting Costs
We study service scheduling problems in a slotted system in which agents arrive with service requests according to a Bernoulli process and have to leave within two slots after arrival, service costs are quadratic in serv…
SchedulingAdaptive Double-Booking Strategy for Outpatient Scheduling Using Multi-Objective Reinforcement Learning
Patient no-shows disrupt outpatient clinic operations, reduce productivity, and may delay necessary care. Clinics often adopt overbooking or double-booking to mitigate these effects. However, poorly calibrated policies c…
Reinforcement LearningRobust Appointment Scheduling with Waiting Time Guarantees
Appointment scheduling problems under uncertainty encounter a fundamental trade-off between cost minimization and customer waiting times. Most existing studies address this trade-off using a weighted sum approach, which …
SchedulingTS-EoH: An Edge Server Task Scheduling Algorithm Based on Evolution of Heuristic
With the widespread adoption of 5G and Internet of Things (IoT) technologies, the low latency provided by edge computing has great importance for real-time processing. However, managing numerous simultaneous service requ…
Edge-computingSchedulingFIKIT: Priority-Based Real-time GPU Multi-tasking Scheduling with Kernel Identification
Highly parallelized workloads like machine learning training, inferences and general HPC tasks are greatly accelerated using GPU devices. In a cloud computing cluster, serving a GPU's computation power through multi-task…
Cloud ComputingGPUScheduling