• Journal of the Korean Professional Engineers Association
• /
• v.28 no.3
• /
• pp.121-134
• /
• 1995

To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit con-trol devices located In common manufacturing zone and operated by connecting them. The network management system, which controls and supervises the network resources in the communication network, is the function that is necessarily required in this net-work. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the token rotation time and waiting time for the network operation. On the evalution of the performance, the data packet length varies from 10 bytes to 100 bytes in the operation of the group manage-ment network, the variation of the token rotation time and waiting time is less than 10 msec. When the variation of the data packet lenhth is less than 50 bytes, differences in token rotation time or waiting time is unnoticable. Since the waiting time in this case is less than 10 msec, response time Is fast enough.

• Journal of Korean Port Research
• /
• v.5 no.2
• /
• pp.19-37
• /
• 1991

This work aims to : establish a model of the container physical distribution system of Pusan port comprising 4 sub-systems of a navigational system, on-dock cargo handling/transfer/storage system, off-dock CY system and an in-land transport system : examine the system regarding the cargo handling capability of the port and analyse the cost of the physical distribution system. The overall findings are as follows : Firstly in the navigational system, average tonnage of the ships visiting the Busan container terminal was 33,055 GRT in 1990. The distribution of the arrival intervals of the ships' arriving at BCTOC was exponential distribution of $Y=e^{-x/5.52}$ with 95% confidence, whereas that of the ships service time was Erlangian distribution(K=4) with 95% confidence, Ships' arrival and service pattern at the terminal, therefore, was Poisson Input Erlangian Service, and ships' average waiting times was 28.55 hours In this case 8berths were required for the arriving ships to wait less than one hour. Secondly an annual container through put that can be handled by the 9cranes at the terminal was found to be 683,000 TEU in case ships waiting time is one hour and 806,000 TEU in case ships waiting is 2 hours in-port transfer capability was 913,000 TEU when berth occupancy rate(9) was 0.5. This means that there was heavy congestion in the port when considering the fact that a total amount of 1,300,000 TEU was handled in the terminal in 1990. Thirdly when the cost of port congestion was not considered optimum cargo volume to be handled by a ship at a time was 235.7 VAN. When the ships' waiting time was set at 1 hour, optimum annual cargo handling capacity at the terminal was calculated to be 386,070 VAN(609,990 TEU), whereas when the ships' waiting time was set at 2 hours, it was calculated to be 467,738 VAN(739,027 TEU). Fourthly, when the cost of port congestion was considered optimum cargo volume to be handled by a ship at a time was 314.5 VAN. When the ships' waiting time was set at I hour optimum annual cargo handling capacity at the terminal was calculated to be 388.416(613.697 TEU), whereas when the ships' waiting time was set 2 hours, it was calculated to be 462,381 VAN(730,562 TEU).

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.29 no.4
• /
• pp.339-351
• /
• 2023

Purpose: The purpose of this study is to identify the educational needs of virtual reality simulations that can be applied to novice nurses during the waiting period before starting work in a hospital. Methods: A convergent mixed methods was used. The survey data were collected from 230 novice nurses, and a focus group interview was conducted with 6 new nurses. The data were collected from November 2022 to January 2023. Descriptive statistics, a frequency analysis, independent t-test, and an Importance-Performance Analysis were performed using SPSS 24.0. Results: Appropriate topics for virtual reality simulation education were indicated to be medications and intravenous injections, which are high priority topics in quantitative and qualitative research. The novice nurses wanted group activity training three to four times a week for two weeks before beginning work in a hospital. They also wanted an immersive virtual reality system based on a real hospital environment. Conclusion: Based on the above results, this study provides basic data for the development of a virtual reality simulation education that can improve the adaptation of novice nurses to clinical practice. A strategy was suggested to utilize the waiting time before beginning work in a hospital as educational time.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2006.04a
• /
• pp.14-19
• /
• 2006

This study examined the effect of waiting in a service queue on the evaluation of service quality focused on its overall process, mediators and moderators The conceptual model of this paper integrates key variables derived from previous studies of consumer waiting behavior. Data obtained from actual customers in service queue at a hospital was used to test the theoretical framework. First, results from the path analysis confirm that negative affect and acceptability of the wait function as mediators in the process that the perceived duration of the wait affects customer's evaluation of overall service quality. Second, the analysis of the data, with the use of moderate regression shows that disconfirmation of wait time expectations, transaction importance, stability of wait time and wait environment work as moderate variables for the relationship between perceived duration of wait and negative affect. For the relationship between perceived wait time and acceptability of the wait, on the other hand, only transaction import ante shows a significant effect as a moderator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4349-4371
• /
• 2019

Moldable parallel tasks are widely used in different areas, such as weather forecast, biocomputing, mechanical calculation, and so on. Considering the deadline and the speedup, scheduling moldable parallel tasks becomes a difficulty. Past work majorly focuses on the LA (List Algorithms) or OMA (Optimizing the Middle Algorithms). Different from prior work, our work normalizes execution time and makes all tasks have the same scope in normalized execution time: [0,1], and then according to the normalized execution time, a method is used to search for the reference execution time without considering the deadline of tasks. According to the reference execution time, we get an initial scheduling result based on AFCFS (Adaptive First Comes First Served) policy. Finally, a heuristic approach is used to improve the performance of the initial scheduling result. We call our method HSRET (a Heuristic Scheduling method based on Reference Execution Time). Comparisons to other methods show that HSRET has good performance in AWT (Average Waiting Time), AET (Average Execution Time), and PUT (Percentages of Unfinished Tasks).

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.63-74
• /
• 2008

The design of best efficient production process is common requirements of the production strategy department and the process planning department to maximize the revenue and accomplish target production volumes in the production periods. And they use several general methods for that-line-balancing, removing of the bottle-neck process, facility ramp-up, increasing of the worker's utilization, etc. But, those methods have depended on analytic, static and arithmetic calculations, yet. So, irregular work-waiting time causing the delay time isn't include in extracting production capacity, especially in the line production process. The work-waiting time is changed irregularly along the variation of each machine and very important for calculate real product lead-time and forecasting target production volumes. At this thesis, i'm going to mention the importance of the delay time of conveyor system which can be extracted by discrete-event simulation. And suggest it as a new main variable that must be considered at designing new production system. Then experimented and tested that's effects in the H-company case, conveyor based line production process.

• 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.

• Advances in aircraft and spacecraft science
• /
• v.9 no.4
• /
• pp.335-347
• /
• 2022

Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.3
• /
• pp.147-155
• /
• 2016

Industry 4.0's goal is the 'Smart Factory' that integrates and controls production process, procurement, distribution and service based on the fundamental technology such as internet of the things, cyber physical system, sensor, etc. Basic requirement for successful promotion of this Industry 4.0 is the large supply of semiconductor. However, company I who produces dicing blades has difficulty to meet the increasing demand and has hard time to increase revenue because its raw material includes high price diamond, and requires very complex and sensitive process for production. Therefore, this study is focused on understanding the problems and presenting optimal plan to increase productivity of dicing blade manufacturing processes. We carried out a study as follows to accomplish the above purposes. First, previous researches were investigated. Second, the bottlenecks in manufacturing processes were identified using simulation tool (Arena 14.3). Third, we calculate investment amount according to added equipments purchase and perform economic analysis according to cost and sales increase. Finally, we derive optimum plan for productivity improvement and analyze its expected effect. To summarize these results as follows : First, daily average blade production volume can be increased two times from 60 ea. to 120 ea. by performing mixing job in the day before. Second, work flow can be smoother due to reduced waiting time if more machines are added to improve setting process. It was found that average waiting time of 23 minutes can be reduced to around 9 minutes from current process. Third, it was found through simulation that the whole processing line can compose smoother production line by performing mixing process in advance, and add setting and sintering machines. In the course of this study, it was found that adding more machines to reduce waiting time is not the best alternative.