• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1622-1631
• /
• 2007

To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.73-80
• /
• 2001

Barrier is widely used for synchronization in parallel programs. Since the process arrived earlier than others should wait at the barrier, the total processor utilization decreases. In this paper, to find the sources of the barrier waiting time, parallel programs are executed on the various grain sizes through execution-driven simulations. In simulation studies, we found that even if approximately equal amounts of work are distributed to each processor, all processes may not arrive at a barrier at the same time. The reasons are that the different numbers of cache misses and instructions within partitioned grains result in the difference in arrival time of processors at the barrier.

• International Journal of Quality Innovation
• /
• v.2 no.2
• /
• pp.101-120
• /
• 2001

In this paper jobshop scheduling problem was considered on automated manufacturing systems with the closed loop and unidirectional material handling system. The objective of this research is to develop and evaluate heuristic scheduling procedures to improve productivity by minimizing makespan. Especially travel time of material handling system as well as processing time was considered in the proposed algorithms, A new heuristic algorithms are proposed and illustrates the proposed algorithm. The heuristic algorithms are implemented for various cases. The results show that the proposed algorithms provide better solutions in productivity, frequency, job waiting time and the number of waiting jobs than the random scheduling algorithm.

• Environmental and Resource Economics Review
• /
• v.11 no.4
• /
• pp.659-687
• /
• 2002

This study used a discrete choice model to investigate an association between air pollution and hospital visits for acute respiratory symptoms with the national health interview survey conducted in 1998 in South Korea. The results showed that $NO_2$ and TSP were significantly related to hospital visits in a single-pollutant model, but when they were simultaneously considered, only $NO_2$ remained significant. It was estimated as $NO_2$ level increased by 10%(0.0027ppm) from 0.027ppm (the mean $NO_2$ level), hospital visits increase by 0.176%. This study also measured respondent's out-of-pocket expense and the time cost for commuting and waiting for the visit. We found that on the average, out-of-pocket expense is 5,600 won per hospital visit, but the total cost per hospital visit is measured at 33,440 won with time cost of commuting and waiting at 27,840 won. Time cost was over 63.6~83.3% of the total cost per hospital visit.

• Journal of Korea Multimedia Society
• /
• v.22 no.7
• /
• pp.804-814
• /
• 2019

The patient's waiting time and length of stay have been reported as a factor decreasing their satisfaction in the hospital, especially in developing countries. This paper focuses on modeling hospital's outpatient department workflow in a developing country and optimizing the patient waiting time as well as total length of stay. By using discrete-event simulation, many alternative scenarios have raised, such as adding more working time, altering human resources, and adjusting the staff's responsibility, those scenarios will be examined to explore better settings for the hospital. The results show that possible to achieve a 9.6% reduction in patient total length of stay and it could be accomplished without adding more resources to the hospital.

• Health Policy and Management
• /
• v.8 no.1
• /
• pp.183-202
• /
• 1998

This study is to investigate patient's choice of health care and the demand for Korean traditional medicine care in rural areas in 1995. It tried to evaluate the effect of out-of-pocket expenditure, travel time, and waiting time on improving care-seeking and substituting clinical medicine for pharmacy care and Korean traditional medicine care in rural areas. The statistical model of this study is conditional logit to estimate effects of choice-specific and individual-specific characteristics on the choice of type of services. This study used, as explanatory variables, average out-of-pocket payment, travel time, and waiting time of services required to use the services. The model was empirically tested using data from 1995 Korean National Health Survery. The results showed that rural Koreans responded to out-of pocket payment and travel time. Increases of out-of-pocket payment and travel time decreased the probability to choose care in rural Korea. Rural Koreans were more likely to seek care than others with low out-of-pocket payment and travel time. The probability of choosing Korean traditional medicine were higher among the members of the households with higher education level and older persons, while they were lower in the households with large family than others compared with the probabilities of choosing public health facilities. The result of this study implies that policy on use of health care in rural Korea can be focused in managing travel time and out-of-pocket payment.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.292-297
• /
• 2000

This paper proposes a new concept of coordinating green time which controls 10 traffic intersection systems. For instance, if we have a baseball game at 8 pm today, traffic volume toward the baseball game at 8 pm today, traffic volume toward the baseball game will be increased 1 hour or 1 hour and 30 minutes before the baseball game. At that time we can not predict optimal green time Even though there have smart elctro-sensitive traffic light system. Therefore, in this paper to improve average vehicle speed and reduce average vehicle waiting time, we created optimal green time using fuzzy rules and neural network. Computer simulation results proved reducing average vehicle waiting time which proposed coordinating green time better than electro-sensitive traffic light system dosen't consider coordinating green time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.458-468
• /
• 2009

The patching technique has been used for removing initial waiting time of NVOD. The technique was applicable only to time segmented NVOD services. However, data segmented NVOD methods have been known to have less initial waiting time or use less server's bandwidths than the time segmented NVODs. Therefore, we expect that if patching is applied to a data segmented NVOD, a more efficient NVOD service will be possible. But there has not been such approach. In this paper, we propose a new VOD scheduling algorithm that combines the patching technique with a data segmented NVOD, thus it uses less server's bandwidths and removes initial waiting time, hence makes a true VOD service possible. The proposed technique also absorbs the storage overhead necessary for client buffering incurred by patching into the data segmentation policy of the NVOD scheduling, hence does not need any extra overhead of the client's resource. Therefore, it is also applicable to the case that the client has resource limits.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.53-60
• /
• 2022

In a group-testing method, instead of testing a sample, for example, blood individually, a batch of samples are pooled and tested simultaneously. If the pooled test is positive (or defective), each sample is tested individually. However, if negative (or good), the test is terminated at one pooled test because all samples in the batch are negative. This paper considers a queueing system with a two-stage group-testing policy. Samples arrive at the system according to a Poisson process. The system has a single server which starts a two-stage group test in a batch whenever the number of samples in the system reaches exactly a predetermined size. In the first stage, samples are pooled and tested simultaneously. If the pooled test is negative, the test is terminated. However, if positive, the samples are divided into two equally sized subgroups and each subgroup is applied to a group test in the second stage, respectively. The server performs pooled tests and individual tests sequentially. The testing time of a sample and a batch follow general distributions, respectively. In this paper, we derive the steady-state probability generating function of the system size at an arbitrary time, applying a bulk queuing model. In addition, we present queuing performance metrics such as the offered load, output rate, allowable input rate, and mean waiting time. In numerical examples with various prevalence rates, we show that the second-stage group-testing system can be more efficient than a one-stage group-testing system or an individual-testing system in terms of the allowable input rates and the waiting time. The two-stage group-testing system considered in this paper is very simple, so it is expected to be applicable in the field of COVID-19.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.1-13
• /
• 2003

In this paper, LAC(Look-ahead AGV Controller) has been developed for efficient routing of parts in semiconductor and LCD production systems. Several procedures have been developed as sub-modules. LACP(Look-ahead AGV Control Procedure) which controls AGVs using the information on the current and future status of the systems is the main element of the LAC. To support LACP, DSP(Destination Selection Procedure) which determines a destination of a part and AGV call time, SSP(Source Selection Procedure)which selects a part coming next to a buffer when the buffer becomes available. and RTM(Response Time Model) which estimates empty travel time of AGVs and waiting time for an available AGV have been developed. A simulation experiment shows that LAC reduces part's flow time, AGV utilization, average and maximum inventory level of a central buffer, empty travel time of an AGV, and waiting time for an available AGV.