اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsymptotically optimal appointment schedules with customer no-shows
64
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows, to minimize the sum of customer waiting time and server overtime costs. Since appointments need to be scheduled ahead of time we refer to this problem as an optimization problem rather than a dynamic control one. We study this optimization problem in fluid and diffusion scales and identify asymptotically optimal schedules in both scales. In fluid scale, we show that it is optimal to schedule appointments so that the system is in critical load; thus heavy-traffic conditions are obtained as a result of optimization rather than as an assumption. In diffusion scale, we solve this optimization problem in the large horizon limit. Our explicit stationary solution of the corresponding Brownian Optimization Problem translates the customer-delay versus server-overtime tradeoff to a tradeoff between the state of a reflected Brownian motion in the half-line and its local time at zero. Motivated by work on competitive ratios, we also consider a reference model in which an oracle provides the decision maker with the complete randomness information. The difference between the values of the scheduling problem for the two models, to which we refer as the stochasticity gap (SG), quantifies the degree to which it is harder to design a schedule under uncertainty than when the stochastic primitives (i.e., the no-shows and service times) are known in advance. In the fluid scale, the SG converges to zero, but in the diffusion scale it converges to a positive constant that we compute.
قيم البحث
اقرأ أيضاً
This work presents a new mathematical model to depict the effect of obesity on cancerous tumor growth when chemotherapy as well as immunotherapy have been administered. We consider an optimal control problem to destroy the tumor population and minimi
ze the drug dose over a finite time interval. The constraint is a model including tumor cells, immune cells, fat cells, chemotherapeutic and immunotherapeutic drug concentrations with Caputo time fractional derivative. We investigate the existence and stability of the equilibrium points namely, tumor free equilibrium and coexisting equilibrium, analytically. We discretize the cancer-obesity model using L1-method. Simulation results of the proposed model are presented to compare three different treatment strategies: chemotherapy, immunotherapy and their combination. In addition, we investigate the effect of the differentiation order $alpha$ and the value of the decay rate of the amount of chemotherapeutic drug to the value of the cost functional. We find out the optimal treatment schedule in case of chemotherapy and immunotherapy applied.
Consider a set of jobs with independent random service times to be scheduled on a single machine. The jobs can be surgeries in an operating room, patients appointments in outpatient clinics, etc. The challenge is to determine the optimal sequence and
appointment times of jobs to minimize some function of the server idle time and service start-time delay. We introduce a generalized objective function of delay and idle time, and consider $l_1$-type and $l_2$-type cost functions as special cases of interest. Determining an index-based policy for the optimal sequence in which to schedule jobs has been an open problem for many years. For example, it was conjectured that `least variance first (LVF) policy is optimal for the $l_1$-type objective. This is known to be true for the case of two jobs with specific distributions. A key result in this paper is that the optimal sequencing problem is non-indexable, i.e., neither the variance, nor any other such index can be used to determine the optimal sequence in which to schedule jobs for $l_1$ and $l_2$-type objectives. We then show that given a sequence in which to schedule the jobs, sample average approximation yields a solution which is statistically consistent.
We study the store-and-forward packet routing problem for simultaneous multicasts, in which multiple packets have to be forwarded along given trees as fast as possible. This is a natural generalization of the seminal work of Leighton, Maggs and Rao
, which solved this problem for unicasts, i.e. the case where all trees are paths. They showed the existence of asymptotically optimal $O(C + D)$-length schedules, where the congestion $C$ is the maximum number of packets sent over an edge and the dilation $D$ is the maximum depth of a tree. This improves over the trivial $O(CD)$ length schedules. We prove a lower bound for multicasts, which shows that there do not always exist schedules of non-trivial length, $o(CD)$. On the positive side, we construct $O(C+D+log^2 n)$-length schedules in any $n$-node network. These schedules are near-optimal, since our lower bound shows that this length cannot be improved to $O(C+D) + o(log n)$.
We consider a nonlinear SISO system that is a cascade of a scalar bottleneck entrance and an arbitrary Hurwitz positive linear system. This system entrains i.e. in response to a $T$-periodic inflow every solution converges to a unique $T$-periodic so
lution of the system. We study the problem of maximizing the averaged throughput via controlled switching. The objective is to choose a periodic inflow rate with a given mean value that maximizes the averaged outflow rate of the system. We compare two strategies: 1) switching between a high and low value, and 2) using a constant inflow equal to the prescribed mean value. We show that no switching policy can outperform a constant inflow rate, though it can approach it asymptotically. We describe several potential applications of this problem in traffic systems, ribosome flow models, and scheduling at security checks.
We present the first proof-of-principle Cauchy evolutions of asymptotically global AdS spacetimes with no imposed symmetries, employing a numerical scheme based on the generalized harmonic form of the Einstein equations. In this scheme, the main diff
iculty in removing all symmetry assumptions can be phrased in terms of finding a set of generalized harmonic source functions that are consistent with AdS boundary conditions. In four spacetime dimensions, we detail an explicit set of source functions that achieves evolution in full generality. A similar prescription should also lead to stable evolution in higher spacetime dimensions, various couplings with matter fields, and on the Poincare patch. We apply this scheme to obtain the first long-time stable 3+1 simulations of four dimensional spacetimes with a negative cosmological constant, using initial data sourced by a massless scalar field. We present preliminary results of gravitational collapse with no symmetry assumptions, and the subsequent quasi-normal mode ringdown to a static black hole in the bulk, which corresponds to evolution towards a homogeneous state on the boundary.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
