2 citations · 3 across the 5 of their papers we have counts for
5 papers
A framework for window design in delivery schedules
Bharti Bharti, René Bekker, Nikki Levering +1
This paper develops a structured framework for the design and dynamic updating of service time windows in delivery and appointment-based systems. We consider a single-server settin…
Accurate and efficient approximation of large-scale appointment schedules
René Bekker, Bharti Bharti, Michel Mandjes
Setting up optimal appointment schedules requires the computation of an inherently involved objective function, typically requiring distributional knowledge of the clients' waiting…
A queueing-based approach for integrated routing and appointment scheduling
René Bekker, Bharti Bharti, Leon Lan +1
This paper aims to address the integrated routing and appointment scheduling (RAS) problem for a single service provider. The RAS problem is an operational challenge faced by opera…
Dynamic Erdős-Rényi graphs
M. Mandjes, N. J. Starreveld, R. Bekker +1
We propose two classes of dynamic versions of the classical Erdős-Rényi graph: one in which the transition rates are governed by an external regime process, and one in which the tr…
Occupation times for the finite buffer fluid queue with phase-type ON-times
N. J. Starreveld, R. Bekker, M. Mandjes
In this short communication we study a fluid queue with a finite buffer. The performance measure we are interested in is the occupation time over a finite time period, i.e., the fr…