Prof. Uri Yechiali, LIST OF PUBLICATIONS
ARTICLES
1. |
A
Stochastic Bottleneck Assignment Problem |
2. |
On Optimal Balking
Rules and Toll Charges in the GI/M/1 Queueing Process |
3. |
Queueing
Problems with Heterogeneous Arrivals and Service (with P. Naor) |
4. |
A Note on a Stochastic Production-Maximizing Transportation Problem |
5. |
Customers'
Optimal Joining Rules for the GI/M/s Queue |
6. |
A Queueing-Type
Birth-And-Death Process Defined on a Continuous-Time Markov Chain |
7. |
Optimal
Priority-Purchasing and Pricing Decisions in Non-Monopoly and Monopoly Queues
(with I. Adiri) |
8. |
Utilization of Idle
Time in an M/G/1 Queuing System (with Y. Levy) |
9. |
An Application of the Simplex Method for Estimation
Problems Related to Contingency Tables (with E.L. Melnick) |
10. |
Analysis of the Telephone
Information Service |
11. |
A New
Derivation of the Khintchine-Pollaczek Formula |
12. |
A Mathematical
Programming Formulation of Estimation Problems Related to Contingency Tables
(with E.L. Melnick) |
13. |
An M/M/s Queue
with Servers' Vacations (with Y. Levy) |
14. |
On
Optimal Allocation of Trunks in a Local Network of Public Telephone Exchanges
|
15. |
Optimal
Dimensioning of a Certain Local Network |
16. |
On the
Relative Waiting Times in the GI/M/s and the GI/M/1 Queueing Systems |
17. |
On Optimal
Right-of-Way Policies at a Single-Server Station When Insertion of Idle Times
is Permitted (with I. Meilijson)
|
18. |
Performance Analysis of the Chaining Method for
Random-Access Addressing (with H. Mendelson) |
19. |
On the
Hotel Overbooking Problem - An Inventory System with Stochastic Cancellations
(with V. Liberman) |
20. |
Optimal Structures and
Maintenance Policies for PABX Power Systems (with G. Vered) |
21. |
Optimal
Storage Allocations for Serial Files (with H. Meldelson and J. Pliskin) |
22. |
Performance
Measures for Ordered Lists in Random Access Files (with H. Mendelson) |
23. |
Optimal Allocation of Telephone Cable Drums to
Construction Sites - A Cutting Stock Problem with a Generalized Objective
Function (with M. Resh) |
24. |
A New
Approach to the Analysis of Linear Probing Schemes (with H. Mendelson) |
25. |
Stochastic
Allocation Problem (with H. Mendelson and J. Pliskin) |
26. |
Damage Models for Multi-Component Systems (with G.
Gottlieb) |
27. |
Optimal Policies for Data Base Reorganization (with H.
Mendelson) |
28. |
Controlling the
GI/M/1 Queue by Conditional Acceptance of Customers (with H. Mendelson) |
29. |
Number of Matches
and Matched People in the Birthday Problem (with I. Meilijson, M. Newborn
and A. Tenenbein) |
30. |
Optimal
Entering Rules for a Customer with Wait Option at an M/G/1 Queue (with A.
Mandelbaum) |
31. |
The Conditional Residual
Service Time in the M/G/1 Queue (with A. Mandelbaum) |
32. |
The Hotel
Overbooking Problem (with G. Gottlieb) |
33. |
A
Time-dependent Stopping Problem with Application to Live Organ Transplants
(with I. David) |
34. |
Waiting
Times in the Non-Preemptive Priority M/M/c Queue (with O. Kella) |
35. |
Physical
Design of a Random-Access File with Random Insertions and Deletions (with
H. Mendelson) |
36. |
Performance
Analysis of a Direct-Access File with Random Insertions and Deletions
(with H. Mendelson) |
37. |
On Relative Effectiveness in
Duels (with I. Feldman) |
38. |
Priorities
in M/G/1 Queue with Server Vacations (with O. Kella) |
39. |
Sequencing an
N-Stage Process with Feedback |
40. |
Dynamic
Priority Rules for Cyclic-Type Queues (with S. Browne) |
41. |
Dynamic
Routing in Polling Systems (with S. Browne) |
42. |
Scheduling
Deteriorating Jobs on a Single Processor (with S. Browne) |
43. |
Sequential
Assignment Match Processes with Arrivals of Candidates and Offers (with
I. David) |
44. |
Dynamic Server Routing
in Binomial-Gated, Binomial-Exhaustive, Bernoulli-Gated, Bernoulli Exhaustive
and Mixed Polling Systems (with S. Browne) |
45. |
Optimal
Server Scheduling and Dynamic Control in Polling Systems |
46. |
Dynamic
Scheduling in Single Server Multi-Class Service Systems with Unit Buffers
(with S. Browne) |
47. |
Criteria
for Selecting the Relaxation Factor of the Value Iteration Algorithm for
Undiscounted Markov and Semi-Markov Decision Processes (with M. Herzberg)
|
48. |
A Tandem
Jackson Network with Feedback to the First Node (with J. Brandon) |
49. |
Optimal
Dynamic Control of Polling Systems |
50. |
Cyclic
Reservation Schemes for Efficient Operation of Multiple-Queue Single-Server
Systems (with O. Boxma and
H. Levy) |
51. |
On Elevator Polling with
Globally Gated Regime (with E.
Altman and A. Khamisy) |
52. |
Elevator-Type Polling
Systems (with R. Shoham) |
53. |
A Two-Echelon
Multi-Server Markovian Queueing System with a Limited Intermediate Buffer
(with S. Zuta) |
54. |
A Globally
Gated Polling System with Server Interruptions, and Applications to the
Repairman Problem (with O.J. Boxma and
J.W. Weststrate) |
55. |
Cyclic Bernoulli Polling
(with E.
Altman) |
56. |
The MX/G/1
Queue with Single and Multiple Vacations Under the LIFO Service Regime
(with E. Rosenberg) |
57. |
Analysis and Control of
Polling Systems |
58. |
Optimal Repair and
Replacement in Markovian Systems (with N. Douer) |
59. |
Accelerating
Procedures of the Value Iteration Algorithm for Discounted Markov Decision
Processes Based on a One-Step Look-Ahead Analysis (with M. Herzberg) |
60. |
Polling in a Closed
Network (with E. Altman) |
61. |
Gated-Type
Polling Systems with Walking and Switch-in Times (with E.
Altman, H. Blanc and A. Khamisy) |
62. |
One
Attribute Sequential Assignment Match Processes in Discrete Time (with I.
David) |
63. |
Discrete Time Queues with
Delayed Information (with E.
Altman and D. Kofman) |
64. |
Access Control with Delayed Information (with E.
Altman and D. Kofman) |
65. |
On
the K-Step Look-Ahead Analysis of Value Interaction Algorithms for
Markov Decision Processes (with M. Herzberg) |
66. |
Polling Systems with Station
Breakdowns (with D. Kofman) |
67. |
Queueing Networks
with Station Breakdowns and Globally Gated Service Regime (with D.
Kofman) |
68. |
An M/G/1 Queue
with Multiple Types of Feedback and Gated Vacations (with O.J. Boxma )
|
69. |
Note: Minimizing the
Variability of the Waiting Times in a Globally-Gated Elevator-Polling System
(with L. Baxter and F. Harche) |
70. |
Randomly Timed Gated
Queueing Systems (with I. Eliazar) |
71. |
Polling under the
Randomly-Timed Gated Regime (with I. Eliazar) |
72. |
Optimality of
Control Limit Maintenance Policies Under non-Stationary Deterioration (with
Z. Benyamini) |
73. |
Polling
Systems with Permanent and Transient Customers (with R. Armony) |
74. |
Closed Polling Models with
Failing Nodes (with H. Dror) |
75. |
Burst
Arrival Queues with Server Vacations and Random Timers (with M. Shomrony)
|
76. |
A Communication
Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed
Gated Regime (with I. Eliazar and G. Fibich) |
77. |
A Note on the M/G/1 Queue
with a Waiting Server, Timer and Vacations (with O.J. Boxma and S.
Schlegel) |
78. |
Two-Queue Polling
Models with a Patient Server (with O.J. Boxma and S. Schlegel) |
79. |
Polling Systems
with Breakdowns and Repairs (with O. Nakdimon) |
80. |
Routing in Queues with Delayed
Information (with N. Litvak) |
81. |
Dynamic Visit-Order Rules
for Batch-Service Polling (with J. v.d. Wal) |
82. |
Admission and Routing
Control with Partial Information and Limitted Buffers (with E. Altman and
R. Marquez) |
83. |
Exact Probabilistic Analysis
of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
(with G. Zussman and A. Segall) |
84. |
Optimal
Routing Among */M/1 Queues with Partial Information (with A. Altman, T.
Jimenez, and R. Nunez-Queija) |
85. |
On the MX/G/1
Queue with a Waiting Server and Vacations |
86. |
Bridging
Genetic Networks and Queueing Theory (with A. Arazi and E. Ben-Jacob) |
87. |
Modeling
Genetic Regulatory Systems via a G-Network (with A. Arazi) |
88. |
Bluetooth Time Division
Duplex - Analysis as a Polling System (with G. Zussman and A. Segall) |
89. |
Controlling an
Oscillating Jackson-Type Network Having State-Dependent Service Rates
(with A. Arazi and E. Ben-Jacob) |
90`. |
Analysis
of Customers' Impatience in Queues with Server Vacations (with E. Altman)
|
91. |
Fundamental
Characteristics of Queues with Fluctuating Load (with V. Gupta, A.S. Wolf
and M. Harchol-Balter) |
92. |
Infinite-Server
Queues with System's Additional Tasks and Impatient Customers (with E.
Altman) |
93. |
Monitoring
of Stochastic Particle Systems: Analysis and Optimization (with I.
Eliazar) |
94. |
Multi-Server
Queues with Intermediate Buffer and Delayed Information on Service
Completions (with V. Kitsio) |
95. |
Polling Systems with
Job Failures and with Station Failures (with M. Shomrony) |
96. |
Polling Systems with
Positive and Negative Customers (with M. Shomrony) |
97. |
Stationary
Remaining Service Time Conditional on Queue Length (with K. Sigman) |
98. |
Poisson Processes, Ordinary
and Compound (with O. Boxma) |
99. |
Retrial Networks and
Their Application to the Internet Data Traffic (with K. Avrachenkov) |
100. |
Queues with System
Disasters and Impatient Customers when System is Down |
101. |
On the Analysis of the
Bluetooth Time Division Duplex Mechanism (with G. Zussman and A. Segall) |
102. |
Polling
with Gated Batch Service (with O. Boxma and Jan v.d. Wal) |
103. |
M/G/Infinity
Polling Systems with Random Visit Times (with M. Vlasiou) |
104. |
Transmission
Algorithm for Video Streaming Over Cellular Networks (with Y. Falik and
A. Averbuch) |
105. |
A Note on
the M/M/Infinity Queue in Random Environment (with N. Paz) |
106. |
Polling with
Batch Service (with O. Boxma and Jan v.d. Wal) |
107. |
Queues
where Customers of One Queue Act as Servers of the Other Queue (with E.
Perel) |
108. |
An M/M/1 Queue
in Random Environment with Disasters (with N. Paz) |
109. |
Queues with Slow
Servers and Impatient Customers (with N. Perel) |
110. |
On Tandem
Blocking Queues with a Common Retrial Queue (with K. Avrachenkov) |
111. |
Fluid Polling
Systems (with O. Czerniak) |
112. |
Analysis of a
TCP System under Polling-Type Reduction-Signal Procedures (with O.
Czerniak and E. Altman) |
113. |
Orchestrating
Parallel TCP Connections: Cyclic and Probabilistic Polling Policies (with
O. Czerniak and E. Altman) |
114. |
On
Customers Acting as Servers (With E. Perel) |
115. |
Asymmetric
Inclusion Process (with S. Reuveni and I. Eliazar) |
116. |
Queues
in Tandem with Customer Deadlines and Retrials (with J. Reed) |
117. |
Node
Generation and Capacity Reallocation in Open Jackson Networks (with I.
Rosenbaum and I. Ben-Gal) |
118. |
Polling
Systems with Two Alternating Weary Servers (with O. Avissar) |
119. |
A
Retrial System with Two Input Streams and Two Orbit Queues (with A.
Avrachenkov and P. Nain) |
120. |
Asymmetric
Inclusion Process as a Showcase of Complexity (with S. Reuveni and I.
Eliazar) |
121. |
Limit Laws for the
Asymmetric Inclusion Process (with S. Reuveni and I. Eliazar) |
122. |
The Israeli
Queue with Infinite Number of Groups (with N. Perel) |
123. |
The Israeli Queue
with Priorities (with N. Perel) |
124. |
The Israeli
Queue with Retrials (with N. Perel) |
125. |
Occupation Probabilities and
Fluctuations in the Asymmetric Inclusion Process (with S. Reuveni, O.
Hirschberg and I.Eliazar) |
126. |
Finite-Buffer Polling
System with Threshold-Based Switching Policy (with K. Avrachenkov and E.
Perel) |
127. |
The Israeli
Queue with a General Joining Policy (with N. Perel) |
128. |
Finite Two Layered
Queueing Systems (with E.Perel) |
129. |
Two-Queue Polling
Systems with Switching Policy Based on the Queue that is Not Being Served
(with E. Perel) |
130. |
Improving
Efficiency in Service Systems by Performing and Storing "Preliminary
Services" (with G. Hanukov, T. Avinadav, T. Chernonog and U.
Spiegel) |
131. |
A Double-Ended Queueing
Model for Dynamic Allocation of Live Organs Based on Best-Fit Criterion
(with A. Elalouf and Y. Perlman) |
132. |
A Queueing
System with Decomposed Service and Inventoried Preliminary Services (with
G. Hanukov, T. Avinadav, T. Chernonog and U. Spiegel) |
133. |
An ASIP Model
with General Gate Opening Intervals (with O. Boxma and O. Kella) |
134. |
Exact Analysis
for Multiserver Queueing Systems with Cross Selling (with M. Armony, E.
Perel and N. Perel) |
135. |
Generalized
Control-Limit Preventive Repair Policies for Deteriorating Cold and Warm
Standby Markovian Systems (with Y. Barron) |
136. |
Alternating
Server with Non-Zero Switch-Over Times and Opposite-Queue Threshold-Based
Switching Policy (with A. Jolles and E. Perel) |
137. |
Dynamic
Allocation of Stochastically-Arriving Flexible Resources to Random Stream of
Objects with Application to Kidney Cross-Transplantation (with Y. Perlman
and A. Elalouf) |
138. |
Performance
Improvement of a Service System via Stocking Perishable Preliminary Services
(with G. Hanukov, T. Avinadav and T. Chernonog) |
139. |
On Tandem Stochastic Networks with Time-Deteriorating
Product Quality (with Y. Perlman) |
140. |
A Multi-Server Queueing-Inventory System with Stock-Dependent Demand
(with G. Hanukov, T. Avinadav and T. Chernonog) |
141. |
A Polling System with 'Join the Shortest-Serve the Longest' Policy
(with E. Perel and N.Perel) |
142. |
A Service System with
Perishable Products where Customers are either Fastidious or
Strategic (with G. Hanukov, T. Avinadav and T. Chernonog) |
143. |
Explicit Solutions for Continuous-Time QBD Processes by Using Relationships
Between Matrix Geometric Analysis and Probability Generating Functions Method (with G. Hanukov) |
144. |
Ticket Queues with Regular and Strategic Customers (with G. Hanukov and S. Anily) |
145. |
Strategic Behaviour in a Tandem Queue with Alternating Server (with N. Dvir and R. Hassin) |
146. |
Individual and Social Customers' Joining Strategies in a Two-Stage Service System when Discount is Offered to Users of Smartphone Application (with G. Hanukov) |
147. |
The Double-Space Parking Problem (with M. Dreyfuss and Y. Shaki) |
148. |
Quality-Dependent Stochastic Networks (with Y. Liberman) |
149. |
A Multi-Server System with Inventory of Preliminary Services and Stock-Dependent Demand (with G. Hanukov, T. Avinadav and T. Chernonog) |
150. |
Workload Distributions in ASIP Queueing Networks (with O. Boxma and O. Kella) |
151. |
Reducing Risk of Infection - The COVID-19 Queueing Game (with Y. Perlman) |
152. |
The Impact of Infection Risk on Customers Joining Strategies (with Y. Perlman) |
153. |
Performance Measures in a Generalized Asymmetric Simple Inclusion Process (with Y. Yeger) |
154. |
Matrix Approach for Analyzing n-site Generalized ASIP Systems: PGF and Site Occupancy Probabilities (with Y. Yeger) |
155. |
Transplant Queueing |
156. |
The Correlation Between Inter-Departure Times in PH/G/1 Queues (with R. Sagron) |
157. |
A Generalized ASIP with Arrival to All Sites and Particle Movements in All Directions (with Y. Yeger) |
158. |
Orbit While in Service (with G. Hanukov) |
159. |
A 3-Queue Polling System with Join the Shortest - Serve the Longest Policy (with E. Perel and N. Perel) |
160. |
The non-preemptive Join the Shortest Queue - Serve the Longest Queue service system with or without switch-over times (with E. Perel and N. Perel) Mathematical Methods of Operations Research (2024) https://doi.org/10.1007/s00186-023-00848-7 |
161. |
Queues with Service Resetting (with O. Lauber-Bonomo and S. Reuveni) Submitted for Publication (2024) |
162. |
ASIP in Random Environment with Disasters (with Y. Yeger) |
163. |
An M/G/1 Queue withg Repeated Orbit While in Service (with G. Hanukov and Y. Baron) |
164. |
Surge Capacity Hospital Operating Rooms During Mass Casualty Incidents (with G. Horowitz and M. Leshno) |
165. |
A Polling Model with Threshold Switching (with O. Boxma, D. Perry and R. Ravid) |
166. |
The Maximum Operlap Time in the M/G/1/k (with O. Boxma and J. Pender) |