• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.959-975
• /
• 2012

Each year research institutions such as the Korea Employment Information Service(KEIS), a government institution established for the advancement of employment support services, and Job Korea, a popular Korean job website, announce first job waiting times after college graduation. This provides useful information understand and resolve youth unemployment problems. However, previous reports deal with the time as a completely observed one and are not appropriate. This paper proposes a new study on first job waiting times after college graduation set to 4 months prior to graduation. In Korea, most college students hunt for jobs before college graduation in addition, the full-fledged job markets also open before graduation. In this case the exact waiting time of college graduates can be right-censored. We apply a Cox proportional hazards model to evaluate the associations between first job waiting times and risk factors. A real example is based on the 2008 Graduates Occupational Mobility Survey(GOMS).

• Quality Improvement in Health Care
• /
• v.1 no.2
• /
• pp.60-72
• /
• 1994

Background: The number of outpatients visiting large university teaching hospitals has increased drastically with the introduction of a nationwide health care insurance in 1989 and the improvement of the socio-economic status of the population. This resulted in long waiting times for services, particularly prescribed drugs, which have been patients' chief complaints. Hospitals have tried to solve the problem with limited success because their approach lacked comprehensive research. The objective of this study is to investigate associations between waiting times and variables defining a total work system. Methods: Data for the outpatient pharmacy department in a tertiary care university teaching hospital located in Seoul was analyzed to achieve the study objective. Associations of pharmacy system variables -- work load, work force, pharmacist work schedule, machine problems, and inventory control -- with mean and 99th percentile of waiting times were examined by the hierarchical stepwise regression method. Day was a unit of the analyses. Results: The regression models explained 65.8% of variance in the mean waiting time and 61.34% in the 99th percentile of waiting times. The break-down of the printer for drug envelops, Automatic Tablet Counters (ATCs), and main computer system lasted longer than 30 minutes increased the mean for 7.7 minutes, 4.5 minutes, and 7.0 minutes, respectively, and the 99th percentile for 14.8 minutes, 9.0 minutes, and 15.7 minutes, respectively. Concerning the work force, study results showed that there were significant differences in the productivity of pharmacists with work experience more than three years, one to three years, and less than one year, and showed that peak time aid work by pharmacists at job assignments other than the outpatient pharmacy, part-time pharmacists, and the installation of ATCs were effective in reducing waiting times, Finally, study findings indicated that the operational policy of work assignment and rotation schedule, supply and inventory of drugs at work tables, and readiness for undisrupted work during the work hours could have a significant effect on waiting times. Conclusion: The study results indicated that efforts to reduce waiting times for prescribed drugs should be geared toward every components of the pharmacy work system ranging from work schedule of pharmacists and supply of dugs at work tables. These findings should provide hospital managers with right directions in battling the problem.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.469-474
• /
• 2011

In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.306-316
• /
• 2004

We present a closed form approximate analytical model to estimate the expected waiting times for the storage and retrieval requests of an automated storage/retrieval (AS/R) system, assuming that the storage/retrieval (S/R) machine idles either at the rack or at the input/output point. The expected waiting times (and the associated mean queue lengths) can play an important role to decide whether the performance of a stable AS/R system is actually acceptable, to determine buffer size (or length) of the input conveyor, and to compute the number of the rack openings which is required to hold the loads which are requested by processing machines but waiting in the rack to be retrieved by the SIR machine. This model can be effectively used in the early design stage of an AS/R system.

• Journal of Distribution Science
• /
• v.17 no.6
• /
• pp.77-84
• /
• 2019

Purpose - Although an extensive body of research in psychology and marketing focuses on perceived waiting time, no research has examined the effect of the location of the waiting place on perceived waiting time. In particular, this study suggests that customers who are waiting in a restaurant may have different perceived waiting time depending on whether they are in close proximity to the service area (e.g., dining area) or farther from it. In particular, the author examines how and why the location of the waiting place affects the perceived waiting time of the consumer and reveals the mental simulation as its psychological mechanism. Research design, data, and methodology - This study conducted field surveys with customers waiting in real restaurants. Eighty-eight people participated under two conditions: a restaurant with a waiting place near the dining area and a restaurant with a waiting place far from the dining area. Participants responded to questions about perceived waiting time (the dependent variable), mental simulation (the mediator), and demographic variables. To verify the hypothesis, ANOVA and bootstrapping analysis were performed. Results - The major results from the field study are as follows. First, participants perceived wait time differently depending on the location of the restaurant's waiting place: participants in the restaurant with a waiting place close to the dining area perceived significantly shorter waiting times. Second, the effect of the location of the waiting place on the perceived waiting time was mediated by mental simulation: the closer the wait location is to the dining area, the more imagination the customer exercises about the meal, which in turn distracts attention from time flow and shortens the perceived wait time. Conclusion - This study has a theoretical implication in that it extends research on perceived waiting time as the first study of how and why the location of a waiting place affects a customer's perceived waiting time. It has a practical implication that can be used as a marketing tactics to improve the image of the service provider by changing the location of the waiting place.

• Journal of Information Technology Applications and Management
• /
• v.22 no.2
• /
• pp.1-17
• /
• 2015

In this research, we develop and suggest branch and bound algorithms for a two-machine permutation flowshop scheduling problem with the objective of minimizing makespan. In this scheduling problem, after each job is operated on the machine 1 (first machine), the job has to start its second operation on machine 2 (second machine) within its corresponding limited waiting time. In addition, each job has its corresponding ready time at the machine 1. For this scheduling problem, we develop various dominance properties and three lower bounding schemes, which are used for the suggested branch and bound algorithm. In the results of computational tests, the branch and bound algorithms with dominance properties and lower bounding schemes, which are suggested in this paper, can give optimal solution within shorter CPU times than the branch and bound algorithms without those. Therefore, we can say that the suggested dominance properties and lower bounding schemes are efficient.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.109-117
• /
• 2010

In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.

• Journal of the Korean Statistical Society
• /
• v.28 no.4
• /
• pp.523-533
• /
• 1999

We consider the M/G/1 queueing model with D-policy. The server is turned off at the end of each busy period and is activated again only when the sum of the service times of all waiting customers exceeds a fixed value D. We obtain the distribution of unfinished work and show that the unfinished work decomposes into two random variables, one of which is the unfinished work of ordinary M/G/1 queue. We also derive the distribution of queue waiting time.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.267-288
• /
• 1995

We investigate a multiclass priority system with a mixed service discipline, and propose a new approach to the analysis of performance measures (mean waiting times) of the system. Customers are preferentially served in the order of priority. The service discipline at each station is either gated or exhaustive discipline. We formulate mean waiting times as functions on the state of the system. We first consider the system at an arbitrary system state to obtain explicit formulae for the mean waiting times, and then derive their steady state values by using the property of Poisson arrivals to see time averages and the generalized Little's formula.