What is the value of pledges if they are often reneged upon? In this paper, we show—both theoretically and experimentally—that can be used to screen donors better understand their motives for giving. return, nonprofit managers use information glean from target future charitable giving appeals interventions donors, such as expressions gratitude. an experiment, find that offering option pledge gi...

This paper presents stochastic modelling of a single server, finite buffer Markovian queuing system with discouraged arrivals, balking, reneging, and retention reneged customers. Markov process is used to derive the steady-state solution model. Closed form expressions using probability generating functions (PGFs) are derived presented for both classical novel performance measures. In addition, ...

We consider the problem of computing multiple headways for a single bus line to maximize the expected daily profit. The stochastic bus-line model assumes that (1) the passenger arrivals follow a Poisson process with possible reneging; (2) the number of alighting passengers at each stop follows a binomial distribution; and (3) the bus travel time follows a Weibull distribution. The objective fun...

An explicit formula for the Skorokhod map Γ0,a on [0, a] for a > 0 is provided and related to similar formulas in the literature. Specifically, it is shown that on the space D[0,∞) of right-continuous functions with left limits taking values in R, Γ0,a(ψ)(t) = ψ(t) − [( ψ(0) − a )+ ∧ inf u∈[0,t] ψ(u) ] ∨ sup s∈[0,t] [ (ψ(s) − a) ∧ inf u∈[s,t] ψ(u) ] . is the unique function taking values in [0,...

Consider an Ornstein–Uhlenbeck process with reflection at the origin. Such a process arises as an approximating process both for queueing systems with reneging or state-dependent balking and for multiserver loss models. Consequently, it becomes important to understand its basic properties. In this paper, we show that both the steady-state and transient behavior of the reflected Ornstein–Uhlenbe...

this paper investigates a discrete-time impatient customer queue with bernoulli-schedule vacation interruption. the  vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. we obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. cost an...

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...