• 한국병원경영학회지
• /
• 제12권2호
• /
• pp.69-92
• /
• 2007

This research has classified waiting times into the three different ones according to service offering process and investigated the antecedents and consequences of types of waiting times. A service provider's concern and customer involvement were modeled as antecedent variables and negative emotion and service value as dependent variables. The empirical results of the study are as follows. A service provider's concern had significant influences on all the three types of waiting times whereas customer involvement was found to affect preprocess-waiting and postprocess-waiting times. Preprocess-waiting time had a significant impact on both negative emotion and service value and inprocess-waiting time only affects negative emotion. However, postprocess-waiting time had influenced none of the variables. The findings illustrate an important role of concern and involvement regarding to a customer's perceived waiting time and relative importance of waiting types on negative emotion and service value. A summary of the results are reported and managerial implications are discussed.

• Management Science and Financial Engineering
• /
• 제14권1호
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.73-80
• /
• 2005

In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

• 한국경영과학회지
• /
• 제30권1호
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• 대한산업공학회지
• /
• 제20권3호
• /
• pp.139-149
• /
• 1994

For general open queueing network models, the relationship between weak limits of queue lengths and waiting times at stations is investigated under heavy traffic situations. It is shown that under suitable normalization, weak convergence of queue lengths and arrival processes is a sufficient condition for that of waiting times, and is also necessary condition when the network is of feedforward type. Moreover, these weak limits for queue lengths and waiting times are shown to be simply related.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.881-889
• /
• 2005

In this study, we consider characteristics of waiting times in single-server 3-node tandem queues with a Poisson arrival process, finite buffers and deterministic or non-overlapping service times at each queue. There are three buffers: one at the first node is infinite and the others are finite. The explicit expressions of waiting times in all areas of the systems, which are driven as functions of finite buffer capacities, show that the sojourn time does not depend on the finite buffer capacities and also allow one to compute and compare characteristics of waiting times at all areas of the system under two blocking policies: communication and manufacturing blocking. As an application of these results, moreover, an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on waiting times is considered. Some numerical examples are also provided.

• 경영과학
• /
• 제24권1호
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• 한국경영과학회지
• /
• 제29권4호
• /
• pp.1-10
• /
• 2004

In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.639-647
• /
• 1998

We consider a multiclass production system processed by a single machine with cyclic order. Each part belongs to one of several classes and arrives at each queue in a Poisson process. The processing discipline at each queue is either exhaustive or gated. We introduce a new approach to analysis of mean waiting times for each queue. We formulate mean waiting times as cost functions on state of the system. The mean waiting times are obtained by solving a set of O($J^2$) linear equations, where J is the number of queues in the system. We also obtain the mean number of parts of each queue in the system at an arbitrary time. Based on this result, we plot the numerical values of the mean waiting times for several parameter settings.

• 대한산업공학회지
• /
• 제21권2호
• /
• pp.167-181
• /
• 1995

We develop an analytical model to estimate the time a workpiece spends in both input and output queues in trip-based material handling systems. The waiting times in the input queues are approximated by M/G/1 queueing system and the waiting times in the output queues are estimated using the method discussed in Bozer, Cho, and Srinivasan [2]. The analytical results are tested via simulation experiment. The result indicates that the analytical model estimates the expected waiting times in both the input and output queues fairly accurately. Furthermore, we observe that a workpiece spends more time waiting for a processor than waiting for a device even if the processors and the devices are equally utilized. It is also noted that the expected waiting time in the output queue with fewer faster devices is shorter than that obtained with multiple slower devices.