Andradttir Sigrn

Sigrn Andradttir

Information about the author Sigrn Andradttir will soon be added to the site.
Found 25 papers in total
Optimal control of queueing systems with non-collaborating servers
2016
We study the dynamic server allocation problem for tandem queueing systems with an...
Steady‐State Simulation with Replication‐Dependent Initial Transients: Analysis and Examples
2013
The replicated batch means (RBM) method for steady‐state simulation output...
Efficient comparison of constrained systems using dormancy
2013
We consider the problem of finding the best simulated system under a primary...
Dynamic server allocation for unstable queueing networks with flexible servers
2012
This paper is concerned with the dynamic assignment of servers to tasks in queueing...
Flexible servers in tandem lines with setup costs
2012
We study the dynamic assignment of flexible servers to stations in the presence of...
Queueing Systems with Synergistic Servers
2011
We consider tandem lines with finite buffers and flexible, heterogeneous servers that...
Adaptive random search for continuous simulation optimization
2010
We present, analyze, and compare three random search methods for solving stochastic...
Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines
2010
We study the assignment of flexible servers to stations in tandem lines with service...
Fully sequential procedures for comparing constrained systems via simulation
2010
We consider the problem of finding the system with the best primary performance...
Compensating for failures with flexible servers
2007
We consider the problem of maximizing capacity in a queueing network with flexible...
Throughput maximization for tandem lines with two stations and flexible servers
2005
For a Markovian queueing network with two stations in tandem, finite intermediate...
Replicated batch means for steady-state simulations
2006
This paper studies a new steady-state simulation output analysis method called...
Dynamic server allocation for queueing networks with flexible servers
2003
This paper is concerned with the design of dynamic server assignment policies that...
Discrete stochastic optimization using variants of the stochastic ruler method
2005
We present two random search methods for solving discrete stochastic optimization...
Parallel simulation of transfer lines by time segmentation
2004
This paper is concerned with the development of efficient parallel simulation...
Efficiency of time segmentation parallel simulation of finite Markovian queueing networks
2003
We present an approach for using parallel processors to simulate long sample paths of...
Server assignment policies for maximizing the steady-state throughput of finite queueing systems
2001
For a system of finite queues, we study how servers should be assigned dynamically to...
A modification of the stochastic ruler method for discrete stochastic optimization
2001
We propose a modified stochastic ruler method for finding a global optimal solution to...
A simulated annealing algorithm with constant temperature for discrete stochastic optimization
1999
We present a modification of the simulated annealing algorithm designed for solving...
Choosing the number of conditioning events in judgemental forecasting
1997
One method for judgemental forecasting involves use of decomposition; i.e. estimating...
On the choice of alternative measures in importance sampling with Markov chains
1995
In the simulation of Markov chains, importance sample involes replacing the original...
A stochastic approximation algorithm with varying bounds
1995
Many optimization problems that are intractable with conventional approaches will...
Optimization of the transient and steady-state behavior of discrete event systems
1996
The paper presents a general framework for applying simulation to optimize the...
Potentially unlimited variance reduction in importance sampling of Markov chains
1996
The authors consider the application of importance sampling in steady-state...
Papers per page: