• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2016

In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

• The Journal of Korean Society for Radiation Therapy
• /
• v.26 no.2
• /
• pp.217-224
• /
• 2014

Purpose : Conventional, IMRT, at CSI treatment with VMAT, this study compare the treatment plan with dose changes measured at Junction field according to the error of Setup. Materials and Methods : This study established Conventional, the IMRT, VMAT treatment planning for CSI therapy using the Eclipse 10.0 (Eclipse10.0, Varian, USA) and chose person in Seoul National University Hospital. Verification plan was also created to apply IMRT QA phantom for each treatment plan to the film measurements. At this time, the error of Setup was applied to the 2, 4, 6mm respectively with the head and foot direction. ("+" direction of the head, "-" means that the foot direction.) Using IMRT QA Phantom and EBT2 film, was investigated by placing the error of Setup for each Junction. We check the consistency of the measured Film and plan dose distribution by gamma index (Gamma index, ${\gamma}$). In addition, we compared the error of Setup by the dose distribution, and analyzing the uniformity of the dose distribution within the target by calculating the Homogeneity Index (HI). Results : It was figured out that 90.49%-gamma index we obtained with film is agreement with film scan score and dose distribution of treatment plan. Also, depend on the dose distribution on distance, if we make the error of Setup 2, 4, 6mm in the head direction, it showed that 3.1, 4.5, 8.1 at $^*Diff$(%) of Conventional, 1.1, 3.5, 6.3 at IMRT, and 1.6, 2.5, 5.7 at VMAT. In the same way, if we make the error of Setup 2, 4, 6mm in the foot direction, it showed that -1.6, -2.8, -4.4 at $^*Diff$(%) of Conventional, -0.9, -1.6, -2.9 at IMRT, and -0.5, -2.2, -2.5 at VMAT. Homogeneity Index(HI)s are 1.216 at Conventional, 1.095 at IMRT and 1.069 at VMAT. Discussion and Conclusion : The dose-change depend on the error of Setup at the CSI RT(radiation therapy) using IMRT and VMAT which have advantages, Dose homogeneity and the gradual dose gradients on the Junction part is lower than that of Conventional CSI RT. This a little change of dose means that there is less danger on patients despite of the error of Setup generated at the CSI RT.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.163-169
• /
• 2004

In this paper, a conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm. and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate. queue service rate. queue size.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.3
• /
• pp.247-255
• /
• 2002

The objective of this paper is to clarify the decomposition property for $M^{X}$/G/1 queues with generalized vacations so that the decomposition property is better understood and becomes more applicable. As an example model, we use the $M^{X}$/G/1 queue with setup time. For this queue, we correct Choudhry's (2000) steady-state queue size PGF and derive the steady-state waiting time LST. We also present a meaningful interpretation for the decomposed steady-state waiting time LST.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.805-806
• /
• 2007

• IE interfaces
• /
• v.8 no.2
• /
• pp.151-159
• /
• 1995

Two-dimensional cutting stock problem is to find a waste-minimizing method of cutting a single rectangular plane into a number of smaller pieces of known dimensions. In practice, besides wastes, setup cost taken during adjusting is of an important concern. We suggest 2-phased guillotine cutting method as a solution to the problem which minimize wastes and setup costs. Also, in order to reduce the computing time we apply techniques of discretization, cutoff, median. Experimental results show good performance of our algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.12
• /
• pp.41-49
• /
• 2004

Increase of internet users and new types of applied traffics, have led to demand for more bandwidth for each application. Hence, the amount of internet traffic has risen sharply and it has demanded to use limited resources, such as wavelength and bandwidth, more effectively. These kind of needs can be satisfied with OXC(Optical cross-connects) based on GMPLS that carry out IP packet switching and wavelength switching at the same time and Provide very wide bandwidth. In RSVP-TE signaling of GMPLS studied by IETF. every lambda router in core network should be able to convert wavelength. So, lots of wavelength converters and needed and building and managing cost is high. Another problem is that optimized traffic is limited. In this paper We suggest strengthened GMPLS RSVP-TE signaling algorithm for a better lightpath setup. When setup signaling is blocked suggested algorithm does not send PathErr message to Edge Router, but looks for nearest lambda router which can convert wavelength and carry out setup signaling from that node. Such algorithm can reduce the chance of blocked lightpath setup signaling and provide effective arrangement of lambda router in core network by calculating proper number of wavelength converter.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2413-2417
• /
• 2003

This paper proposes an improvement of a QoS based routing protocol. The hierarchical source routing algorithm[4] was improved by including of the Crank-Back algorithm[2]. The Crank-Back capability is the ability to solve the problem of selecting the wrong route because of using unsynchronized routing information in the ingress router. In order to reduce time of reversing the call-setup process back to the ingress router, spare-route information is included with a call-setup packet. Spare-route information could be used by every router to find the next appropriated link itself when insufficient resource of the selected link was found. The proposed algorithm improves the performance of the source routing call-setup process significantly.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.93-104
• /
• 1994

One of the typical assumptions of the studies to determine economic production quantity is that yield rate of a given manufacturing process is 100% or constant after setup. However, in the real world, there are many manufacturing processes of which yield rates are quite low just after setup and then increasing with time until they reach the target rates which are set strategically. This period is usually called "stabilization period". During the stabilization period, defectives are produced, which incur cost (defective cost). In this study, an optimal production quantity for this situation is presented. Also, it is shown that defective cost acts like setup cost and therefore, increases the economic production quantity.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.