• Journal of Korean Society of Transportation
• /
• v.33 no.5
• /
• pp.488-496
• /
• 2015

The main reason to install pedestrian pushbuttons is improving traffic operations. The current guideline for the installation of signal systems with pedestrian pushbuttons is car-oriented. It is difficult to clearly understand the guideline because there isn't an in-depth study to compare the pros and cons of the pedestrian- and vehicle-oriented methods in terms of waiting time. Thus, this study aims to estimate the waiting times of pedestrians and vehicles. The two delay times are compared considering the hypothetical circumstances such as geometry, pedestrian crossing time, pedestrian/vehicle counts and arrival distribution. The results show that when the pedestrian traffic volume exceeds 97 ped/h in the case of a two-lane road (one lane in each direction) the pushbutton system is effective and beneficial to pedestrians. It means that the total waiting time of pedestrians is less than the one of vehicles. Additional four scenarios are designed and tested by varying the number of lanes and design speeds. In conclusion, the pushbutton signal is more beneficial for pedestrians when the number of pedestrians is less than or equal to 85, 70, and 70 ped/h for the three-lane scenario, the four-lane with the design speed of 80km/h scenario, and the four-lane with the design speed of 100km/h, respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.2
• /
• pp.51-65
• /
• 2011

We compared a CONWIP(constant work-in-process) system with a kanban system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as CONWIP and kanban is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were used to demonstrate the proposed analysis. The numerical results support the previous studies that CONWIP outperforms kanban in terms of expected waiting time and WIP. Unlike the kanban case, sequencing workstations in a CONWIP does not affect the performance of the system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.26-30
• /
• 2004

We consider an AS/RS(Automated Storage/ Retrieval System) which performs both of single and dual commands. The service times of single and dual commands are assumed to be differently distributed. Steady-state probabilities at the service completion epochs are calculated. Then, we transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of an AS/RS, and obtain approximated means of queue lengths and waiting times.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.1-16
• /
• 2011

With the increasing number of vehicles in use in our daily life and the rise of traffic congestion problems, many methods and models have been developed for real time optimisation of traffic lights. Nevertheless, most methods which consider real time physical queue sizes of vehicles waiting for green lights overestimate the optimal cycle length for such real traffic control. This paper deals with the development of a generic hybrid model describing both physical traffic flows and control of signalised intersections. The firing times assigned to the transitions of the control part are considered dynamic and are calculated by a simplified optimisation method. This method is based on splitting green times proportionally to the predicted queue sizes through input links for each new cycle time. The proposed model can be easily translated into a control code for implementation in a real time control system.

• IE interfaces
• /
• v.14 no.1
• /
• pp.67-78
• /
• 2001

This paper describes the simulation study which estimates the container crane efficiency in container terminal. In most simulation studies, it is assumed that container cranes are available at any time. Though the failures of container cranes don't occur often, they are very serious problems on terminal efficiency. As usual, the failures of container crane cause arrived ships to delay the departure time. In this study, a queueing simulation model for container terminal, which focuses on the failures of container cranes, is designed. The simulation approach appears to be the most appropriate one because it allows to avoid the usual exponential assumption on interarrivals of ships and service times of container cranes. Using the developed model, we tested the efficiency of container cranes considering failures with a real system size and performed the simulation experiment on real container terminal to validate the developed simulation model. The results of simulation experiment were analyzed using output statistics, which include the waiting times of vessels and yard tractors, the utilization for container cranes, and the berth occupancy rates.

• International Journal of Computer Science & Network Security
• /
• v.22 no.8
• /
• pp.45-54
• /
• 2022

In this study, a multi-objective robust job-shop scheduling (JSS) model was developed. The model considered multi-jobs and multi-machines. The model also considered uncertain processing times for all tasks. Each job was assigned a specific due date and a tardiness penalty to be paid if the job was not delivered on time. If any job was completed early, holding expenses would be assigned. In addition, the model added idling penalties to accommodate the idling of machines while waiting for jobs. The problem assigned was to determine the optimal start times for each task that would minimize the expected penalties. A numerical problem was solved to minimize both the makespan and the total penalties, and a comparison was made between the results. Analysis of the results produced a prescription for optimizing penalties that is important to be accounted for in conjunction with uncertainties in the job-shop scheduling problem (JSSP).

• Journal of Astronomy and Space Sciences
• /
• v.12 no.2
• /
• pp.179-195
• /
• 1995

RT Per has been known as a close binary of which the orbital period has unpredictably varied so far. Although there are no agreements with the working mechanism for the changes of the period, two interpretations have been suggested and waiting for to be tested: 1) light-time effects due to the unseen 3rd and 4rd bodies (Panchatsaram 1981), 2) Abrupt period-changes, due to internal variations of the system (e.g. mass transfer or mass loss) superimposing to the light-time effect by a 3rd body (Frieboes-Conde & Herczeg 1973). In the point of view that the former interprepation models could predict the behavior of the changes of the orbital period theoretically, we checked whether the recent observed times of minimum lights follow the perdictions by the first model or not. We confirmed that the observed times of minimum lights have followed the variations calculated by the light-times effects due to the 3rd and 4rd bodies suggested by Panchatsatam. In this paper a total of 626 times of minimum lights were reanalyzed in terms of the light-time effects by the 3rd and 4rd bodies. We concluded that the eclipsing pair in SVCam system moves in an elliptic orbit about center of mass of the triple system with a period of about $42.^y2$, while the mass center of the triplet is in light-time orbit about the center of mass of the quadruple system with a period of $120^y$. The mean masses deduced for the 3rd and 4rd bodies were $0.89m_\odot$ and $0.82m_\odot$, respectively.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.111-120
• /
• 2009

Network-on-chip (NoC) architecture provides a highper-formance communication infrastructure for system-on-chip designs. Circuit-switched networks guarantee transmission latency and throughput; hence, they are suitable for NoC architecture with real-time traffic. In this paper, we propose an efficient integrated scheme which automatically maps application tasks onto NoC tiles, establishes communication circuits, and allocates a proper bandwidth for each circuit. Simulation results show that the average waiting times of packets in a switch in $6{\times}6$6, $8{\times}8$, and $10{\times}10$ mesh NoC networks are 0.59, 0.62, and 0.61, respectively. The latency of circuits is significantly decreased. Furthermore, the buffer of a switch in NoC only needs to accommodate the data of one time slot. The cost of the switch in the circuit-switched network can be reduced using our scheme. Our design provides an effective solution for a critical step in NoC design.

• Quality Improvement in Health Care
• /
• v.20 no.1
• /
• pp.28-40
• /
• 2014

Objectives: Prescriptions for Parkinson's can be dispensed at the outpatient pharmacy. In general, the treatment of Parkinson's disease requires a multitude of drugs, sometimes taken 4 to 6 times a day at specific times as prescribed by the medical practitioner. Said "time-specific therapy" is one of the major reasons of dispensing delay observed at the outpatient pharmacy. Because our establishment lacked a computerized system to support time-specific prescriptions, they were not recognized electronically. They had to be issued and dispensed manually, which required a greater amount of time than the automated process. To solve the problem, a new sig code was developed to handle time-specific prescriptions with a comprehensive automated dispensing system to support it. This study aims to create electronic programs and streamline the process to increase dispensing performance. And thus, ensure greater patient safety and dispensing accuracy within a shorter dispensing time and also increase employee satisfaction through a decreased workload. Methods: After identifying the problems caused by non-electronic prescriptions an automated system that allowed the issuance of time-specific prescriptions was developed. A new sig code was created that could be recognized by the Pharmacy electronic medical program, the label printer to group medications by administration times and the Automatic Tablet Counter(ATC) to count the grouped drugs accordingly. Result: With the new sig code, the practitioner became able to electronically select the times of drug administration while issuing the prescription. This 'time-specific prescription' can now be recognized by the pharmacy electronic medical program, the label printer and the ATC like any other prescription. Conclusion: The developed program started operating on September 2013. Although not all Parkinson's patients have been issued with the new electronic 'time-specific prescription', the overall dispensing process has become more streamlined and accurate. As the medical team continues to integrate the new system in their practice an additional decrease of the dispensing time is predicted. Future program upgrades and other new time-saving approaches are scheduled, which are expected to further increase the service quality of our outpatient pharmacy.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.3
• /
• pp.37-44
• /
• 1989

Recently recognize the labor productivity of port physical distribution system in the port and shipping areas, Much Efforts for evaluating this productivity has been made continuously. BUt still there is little study, so far, on a systematic research for the management of port labor gangs, and even those were mainly depended on a rule of thumb. Especially the object of this study is to introduce the method of optimal allocation and assignment for the labor gangs per pier unit in the multiple ships berthed at an arbitary pier or port. In case the multiple ships have a homogeneous cargoes or do not have sufficient labor gangs to be assigned. The problem of optimal allocation and assignment of the labor gangs to be i) formalized with multi-state decision process in form of difference equation as the pattern which converted the independent multiple ships into a single ship with the intra-multiple ships, and ii) the optimal size of labor gangs could be obtained through the simple mathematical method instead of complicated dynamic programming, and iii) In case of shortage of labor gangs available the evaluation function considering the labor gangs available and total shift times was introduced, and iv) the optimal allocation and assignment of labor gangs was dealt at the point of minimizing the summation of the total shift times and at the point of minimizing the total cost charged for the extra waiting time except PHI time during port times for the multiple ships combinations.