Ayhan Hayriye

Hayriye Ayhan

Information about the author Hayriye Ayhan will soon be added to the site.
Found 17 papers in total
Optimal control of queueing systems with non-collaborating servers
Optimal control of queueing systems with non-collaborating servers
2016
We study the dynamic server allocation problem for tandem queueing systems with an...
Flexible servers in tandem lines with setup costs
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
Queueing Systems with Synergistic Servers
2011
We consider tandem lines with finite buffers and flexible, heterogeneous servers that...
Tandem queues with subexponential service times and finite buffers
Tandem queues with subexponential service times and finite buffers
2010
We focus on tandem queues with subexponential service time distributions. We assume...
Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines
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...
A note on optimal pricing for finite capacity queueing systems with multiple customer classes
A note on optimal pricing for finite capacity queueing systems with multiple customer classes
2008
This article investigates optimal static prices for a finite capacity queueing system...
Compensating for failures with flexible servers
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
Throughput maximization for tandem lines with two stations and flexible servers
2005
For a Markovian queueing network with two stations in tandem, finite intermediate...
Relationships among three assumptions in revenue management
Relationships among three assumptions in revenue management
2004
This note discusses the relationships among three assumptions that appear frequently...
Dynamic server allocation for queueing networks with flexible servers
Dynamic server allocation for queueing networks with flexible servers
2003
This paper is concerned with the design of dynamic server assignment policies that...
Optimal prices for finite capacity queueing systems
Optimal prices for finite capacity queueing systems
2006
We prove a lower bound on the optimal price for a fairly large class of blocking...
Expansions for joint Laplace transform of stationary waiting times in (max, +)-linear systems with Poisson input
Expansions for joint Laplace transform of stationary waiting times in (max, +)-linear systems with Poisson input
2001
We give a Taylor series expansion for the joint Laplace transform of stationary...
Laplace transform and moments of waiting times in Poisson driven (max,+) linear systems
Laplace transform and moments of waiting times in Poisson driven (max,+) linear systems
2001
(Max,+) linear systems can be used to represent stochastic Petri nets belonging...
Server assignment policies for maximizing the steady-state throughput of finite queueing systems
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...
Expansion formulae for characteristics of cumulative cost in finite horizon production models
Expansion formulae for characteristics of cumulative cost in finite horizon production models
2001
We consider the expected value and the tail probability of cumulative shortage and...
Scheduling of multi-class single-server queues under nontraditional performance measures
Scheduling of multi-class single-server queues under nontraditional performance measures
2000
We consider a multi-class production system without setups where many job classes...
An approximation for computing the throughput of closed assembly-type queueing networks
An approximation for computing the throughput of closed assembly-type queueing networks
1999
In this paper, we examine throughput (mean number of completed assemblies per unit...
Papers per page: