Results 141 to 150 of about 635 (170)
Some of the next articles are maybe not open access.
Strategic behavior and social optimization in a double-ended queue with gated policy
Computers and Industrial Engineering, 2017Abstract This paper is concerned with a double-ended queueing system which is motivated by the passenger-taxi problem under a gated policy. This policy makes taxis start to balk when the taxi queue length reaches an upper limit and to join again when the taxi queue length is reduced to a lower limit.
Jinting Wang, Zhe George Zhang
exaly +2 more sources
Further results for the double ended queue
Metrika, 1967For the double ended queue involving taxis and customers at a taxi-stand (Kashyap, 1965 a; b) the probabilities that (i) only taxis are waiting and (ii) only customers are waiting have been investigated by the use of Laplace transform. The L.T.s of the mean queue lengths of taxis and of customers are also obtained.
exaly +2 more sources
Transient behaviour of a double ended Markovian queue
Stochastic Analysis and Applications, 1991This paper studies the transient behaviour of a double–ended Markovian queueing system with finite waiting space. The transition probabilities and other queueing parameters have been obtained in a simple closed form using matrix ...
O P Sharma
exaly +2 more sources
The Double-Ended Queue with Bulk Service and Limited Waiting Space
Operations Research, 1966The double-ended queue involving taxis and customers at a taxi-stand has been considered under the assumption that there is limited waiting space both for customers and for taxis, and that the taxis “serve” the customers in bulk. The arrivals of customers and taxis are taken as general and Poisson respectively.
exaly +3 more sources
Symmetric Min-Max heap: A simpler data structure for double-ended priority queue
Information Processing Letters, 1999Several data structures have been proposed to implement double-ended priority queue operations in O(log n) time, e.g., Min-Max heap [ 11, Deap [2], Diamond deque [3] and back-to-back heap [4]. In MinMax heaps, the even layers form a Min-heap and the odd layers form a Max-heap.
C Pandu Rangan
exaly +2 more sources
Double-ended queues with impatience
Computers & Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. W. Conolly +2 more
openaire +2 more sources
An Unbounded Nonblocking Double-Ended Queue
2016 45th International Conference on Parallel Processing (ICPP), 2016We introduce a new algorithm for an unbounded concurrent double-ended queue (deque). Like the bounded deque of Herlihy, Luchangco, and Moir on which it is based, the new algorithm is simple and obstruction free, has no pathological long-latency scenarios, avoids interference between operations at opposite ends, and requires no special hardware support ...
Matthew Graichen +2 more
openaire +1 more source
Improvements in double ended priority queues
International Journal of Computer Mathematics, 2003In this paper, we present improved algorithms for min–max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended Priority Queue – The Comp. J. 34, 423–427, 1991). We also show that in the worst case, this structure, though slightly costlier to create, is better than min–max heaps of Strothotte (Min–max Heaps and Generalized Priority Queues
M. Ziaur Rahman +2 more
openaire +1 more source
Equilibrium Strategies and Optimal Control for a Double-Ended Queue
Asia-Pacific Journal of Operational Research, 2016In this paper, we study a passenger–taxi matching queue system. The system is modeled as a birth-and-death process. Since the system is so complex, we mainly focus on numerical analysis. A centralized system and a decentralized one are considered. In the centralized system, the government sets thresholds for both passengers and taxis to maximize the ...
Ying Shi, Zhaotong Lian
openaire +2 more sources