Sciweavers

238 search results - page 2 / 48
» Waiting time distribution of generalized later patterns
Sort
View
MSOM
2008
103views more  MSOM 2008»
13 years 4 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
JSSPP
2000
Springer
13 years 8 months ago
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Fabrizio Petrini, Wu-chun Feng
IOR
2008
113views more  IOR 2008»
13 years 5 months ago
Service Competition with General Queueing Facilities
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A fi...
Gad Allon, Awi Federgruen
PODC
1993
ACM
13 years 9 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
QUESTA
2006
119views more  QUESTA 2006»
13 years 5 months ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni