Matching three moments with minimal acyclic phase type distributions
A number of approximate analysis techniques are based on matching moments of
continuous time phase type (PH) distributions. This paper presents an explicit method to …
continuous time phase type (PH) distributions. This paper presents an explicit method to …
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
T Osogami, M Harchol-Balter - Performance Evaluation, 2006 - Elsevier
Approximating general distributions by phase-type (PH) distributions is a popular technique
in stochastic analysis, since the Markovian property of PH distributions often allows …
in stochastic analysis, since the Markovian property of PH distributions often allows …
An exact and efficient algorithm for the constrained dynamic operator staffing problem for call centers
A Bhandari, A Scheller-Wolf… - Management …, 2008 - pubsonline.informs.org
Call center managers are facing increasing pressure to reduce costs while maintaining
acceptable service quality. Consequently, they often face constrained stochastic …
acceptable service quality. Consequently, they often face constrained stochastic …
A closed-form solution for mapping general distributions to minimal PH distributions
T Osogami, M Harchol-Balter - … on Modelling Techniques and Tools for …, 2003 - Springer
Approximating general distributions by phase-type (PH) distributions is a popular technique
in queueing analysis, since the Markovian property of PH distributions often allows …
in queueing analysis, since the Markovian property of PH distributions often allows …
Steady‐state analysis of load balancing with Coxian‐2 distributed service times
This paper studies load balancing for many‐server (N servers) systems. Each server has a
buffer of size b− 1, and can have at most one job in service and b− 1 jobs in the buffer. The …
buffer of size b− 1, and can have at most one job in service and b− 1 jobs in the buffer. The …
[图书][B] Analysis of multi-server systems via dimensionality reduction of Markov chains
T Osogami - 2005 - search.proquest.com
The performance analysis of multiserver systems is notoriously hard, especially when the
system involves resource sharing or prioritization. We provide two new analytical tools for …
system involves resource sharing or prioritization. We provide two new analytical tools for …
[PDF][PDF] Extending continuous time Bayesian networks
Abstract Continuous-time Bayesian networks (CTBNs)(Nodelman, Shelton, & Koller 2002;
2003), are an elegant modeling language for structured stochastic processes that evolve …
2003), are an elegant modeling language for structured stochastic processes that evolve …
Matching more than three moments with acyclic phase type distributions
This paper presents a matching procedure for generating an acyclic phase type distribution
of order N given the first 2 N− 1 moments, if they are feasible. The matching procedure uses …
of order N given the first 2 N− 1 moments, if they are feasible. The matching procedure uses …
A uniformization approach for the dynamic control of queueing systems with abandonments
We consider queueing systems with general abandonment. Abandonment times are
approximated by a particular Cox distribution with all phase exponential rates being the …
approximated by a particular Cox distribution with all phase exponential rates being the …
Analysis of task assignment with cycle stealing under central queue
We consider the problem of task assignment in a distributed server system, where short jobs
are separated from long jobs, but short jobs may be run in the long job partition if it is idle …
are separated from long jobs, but short jobs may be run in the long job partition if it is idle …