Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Uri Yechiali
Information about the author Uri Yechiali will soon be added to the site.
Found
21 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
An ASIP model with general gate opening intervals
2016
We consider an asymmetric inclusion process, which can also be viewed as a model of n...
Queues in tandem with customer deadlines and retrials
2013
We study queues in tandem with customer deadlines and retrials. We first consider a...
Queues where customers of one queue act as servers of the other queue
2008
We consider a system comprised of two connected M / M /˙/˙ type...
Stationary remaining service times conditional on queue length
2007
Mandelbaum & Yechiali and Fakinos derived a simple formula for the (stationary)...
Polling systems with breakdowns and repairs
2003
This work analyzes various polling systems with both random breakdowns and repairs. A...
A communication multiplexer problem: Two alternating queues with dependent randomly-timed gated regime
2002
Two random traffic streams are competing for the service time of a single server...
Routing in queues with delayed information
2003
We compare two routing-control strategies in a high-speed communication network with c...
Closed polling models with failing nodes
2000
Closed polling systems with station breakdowns, under the gated, exhaustive or...
Polling systems with permanent and transient jobs
1999
Almost all polling models studied in the literature deal with ‘open’...
Optimality of control limit maintenance policies under non-stationary deterioration
1999
Control limit type policies are widely discussed in the literature, particularly...
An M/G/1 queue with multiple types of feedback and gated vacations
1997
This paper considers a single-server queue with Poisson arrivals and multiple customer...
One-attribute sequential assignment match processes in discrete time
1995
We consider a sequential matching problem where M offers arrive in a random stream and...
A K-step look-ahead analysis of Value Iteration algorithms for Markov decision processes
1996
We introduce and analyze a general look-ahead approach for Value Iteration Algorithms...
Minimizing the variability of the waiting times in a globally gated elevator polling system
1997
A polling system comprising n queues and a single server is considered. Service is...
Discrete time queues with delayed information
1995
The authors study the behavior of a single-server discrete-time queue with batch...
Accelerating procedures of the value iteration algorithm for discounted Markov decision processes, based on a one-step lookahead analysis
1994
Accelerating procedures for solving discounted Markov decision processes problems are...
The MX/G/1 queue with single and multiple vacations under LIFO service regime
1993
The queue without server vacations, with multiple vacations and with single vacations...
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
1992
The authors study two new cyclic reservation schemes for the efficient operation of...
Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes
1991
The authors present two criteria for selecting the adaptive relaxation factor being...
Dynamic scheduling in single-server multiclass service systems with unit buffers
1991
The problem of optimal dynamic sequencing for a single-server multiclass service...
Priorities in M/G/1 queue with server vacations
1988
The M / G /1 queue with single and multiple server vacations is studied under both the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers