Results 111 to 120 of about 140,960 (162)
Some of the next articles are maybe not open access.
Journal of College & University Foodservice, 1992
A model using wailing the principles was developed to assist with foodservice facilities design. The number of seals needed is calculated. Using values for area per seat previously published the size of the dining area can then be determined. The number of seats needed is dependent upon the meal patterns served, arrival rates of customers, turnover ...
openaire +1 more source
A model using wailing the principles was developed to assist with foodservice facilities design. The number of seals needed is calculated. Using values for area per seat previously published the size of the dining area can then be determined. The number of seats needed is dependent upon the meal patterns served, arrival rates of customers, turnover ...
openaire +1 more source
International Journal of Servant-Leadership, 2011
Having the only choice to wait in line, I spent five hours at water tap in a long line under a hot sun, so that I can get water. When there is no water taps in a village, rivers is the only hope. What happens when rivers also dry at same time?
openaire +2 more sources
Having the only choice to wait in line, I spent five hours at water tap in a long line under a hot sun, so that I can get water. When there is no water taps in a village, rivers is the only hope. What happens when rivers also dry at same time?
openaire +2 more sources
Optimization, 1972
This paper studies the time independent solution of a queueing system wherein units demanding one, two or three service phases arrive with a POISSON POISSON stream at the first channel of the system of three service channels S 1, S 2 and S 3. The server S, attends to units which on being serviced may leave the system (those having only one service ...
openaire +1 more source
This paper studies the time independent solution of a queueing system wherein units demanding one, two or three service phases arrive with a POISSON POISSON stream at the first channel of the system of three service channels S 1, S 2 and S 3. The server S, attends to units which on being serviced may leave the system (those having only one service ...
openaire +1 more source
Waiting Lines with Heterogeneous Servers
Operations Research, 1960A “multiple-booth” server system with nonhomogeneous servers is analyzed under the assumption of Poisson distributed arrivals and exponential service time with different individual mean service rates for each server. Explicit expressions for the state probabilities are obtained in closed form under “steady-state” conditions and the expected length of ...
openaire +2 more sources
Duopoly pricing and waiting lines
European Economic Review, 1978Abstract The paper deals with a model of duopoly pricing in the context of firms providing services to consumers. Each of the firms has a waiting line of customers arriving randomly. The service provided by both firms is identical and the service time of both firms is assumed to obey the same distribution.
David Levhari, Israel Luski
openaire +1 more source
Waiting Lines and Waiting Times
2017This chapter seeks to determine if can we reduce the time it takes to deliver a public health or healthcare service, such as the long waiting times in emergency departments, long waiting lists for under-supported services such as drug rehabilitation, and vast periods of uncertainty for scarce commodities such as organ transplants.
openaire +1 more source
Waiting lines in the endoscopy unit
Gastrointestinal Endoscopy, 2000The efficient management of the endoscopy unit involves issues of scheduling. The aim of this study was to assess efficient use of an endoscopy unit and its relationship to patient waiting.Formulas of queueing theory are applied to patient scheduling in endoscopy.
openaire +2 more sources
Operations Research, 1957
One of the least understood classes of operations problems is that concerned with the design, loading, and, especially, the scheduling of discrete, statistically varying flows through complex networks. The present paper abstracts what is perhaps the simplest theoretical question related to this class of problems, and derives expressions for certain ...
openaire +1 more source
One of the least understood classes of operations problems is that concerned with the design, loading, and, especially, the scheduling of discrete, statistically varying flows through complex networks. The present paper abstracts what is perhaps the simplest theoretical question related to this class of problems, and derives expressions for certain ...
openaire +1 more source
Sequential Arrays of Waiting Lines
Operations Research, 1956The problem considered in this paper is that in which a sequence of service operations must be performed on the units to be serviced. Poisson arrivals and exponential service times are assumed. Four particular cases of service facilities in series are treated, involving infinite storage space between stages, no storage space between stages, finite ...
openaire +1 more source
Waiting in line [queuing theory]
IEEE Potentials, 1996Queuing phenomenon encompasses all activities of our lives. We have to wait in line whenever the number of servers or the service rate of the server does not match the rate at which the customers arrive in the queue. Queuing theory is the formal analysis of this phenomenon in search of finding the optimum solution to this problem so that everybody gets
openaire +1 more source