• Journal of the Korea Safety Management & Science
• /
• v.23 no.3
• /
• pp.27-33
• /
• 2021

The purpose of this study is to present a novel indicator for analyzing machine failure based on its idle time and productivity. Existing machine repair plan was limited to machine experts from its manufacturing industries. This study evaluates the repair status of machines and extracts machines that need improvement. In this study, F-RPN was calculated using the etching process data provided by the 2018 PHM Data Challenge. Each S(S: Severity), O(O: Occurence), D(D: Detection) is divided into the idle time of the machine, the number of fault data, and the failure rate, respectively. The repair status of machine is quantified through the F-RPN calculated by multiplying S, O, and D. This study conducts a case study of machine in a semiconductor etching process. The process capability index has the disadvantage of not being able to divide the values outside the range. The performance of this index declines when the manufacturing process is under control, hereby introducing F-RPN to evaluate machine status that are difficult to distinguish by process capability index.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.220-231
• /
• 2022

Building smart transportation services in urban cities has become a worldwide problem owing to the rapidly increasing global population and the development of Internet-of-Things applications. Traffic congestion and environmental concerns can be alleviated by sharing mobility, which reduces the number of vehicles on the road network. The taxi-parcel sharing problem has been considered as an efficient planning model for people and goods flows. In this paper, we enhance the functionality of a current people-parcel taxi sharing model. The adapted model analyzes the historical request data and predicts the current service demands. We then propose two novel online routing algorithms that construct optimal routes in real-time. The objectives are to maximize (as far as possible) both the parcel delivery requests and ride requests while minimizing the idle time and travel distance of the taxis. The proposed online routing algorithms are evaluated on instances adapted from real Cabspotting datasets. After implementing our routing algorithms, the total idle travel distance per day was 9.64% to 12.76% lower than that of the existing taxi-parcel sharing method. Our online routing algorithms can be incorporated into an efficient smart shared taxi system.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.328-332
• /
• 2015

By logging position data from GPS-equipped construction machines, we re-create daily activities as 3D animations to analyze performance and facilitate look-ahead scheduling. The 3D animation enables going back to any point in time and space to observe the activities as they took place. By segmenting data into a set of activities, it is possible to obtain actual measures of performance such as cycle times, production, speed profiles and idle times. The measures of performance can then be compared to those expected (e.g., theoretical speed profiles vs. observed profiles), and instances of significant difference can be flagged for further investigation. Idle times and queues that exceed prescribed thresholds can also be identified. In general, many of the traditional real-time performance analyses can be performed after the fact. Situations of interest can be identified automatically and the events in this manner enhances effective performance improvement in construction. The proposed research is explained and demonstrated using a real push-loaded earthmoving operation.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.389-393
• /
• 2008

This paper describes a single-server queue where the server is unavailable during some intervals of time, which is referred to as vacations. The major contribution of this work is to derive general formulas for the additional delay in the vacation models of the single vacations, head of line priority queues with non-preemptive service, and multiple vacations and idle time.

• 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.14 no.2
• /
• pp.1-10
• /
• 1988

We consider a vacation system in which the server takes two different types of vacations alternately. We obtain the server idle probability and derive the system size distribution and the waiting time distribution by defining supplementary variables. We show that the decomposition property works for these mixed-vacation queues. We also propose a method directly to obtain the waiting time distribution without resorting to the system equations. The T-policy is revisited and is shown that the cost is minimized when the length of vacations are the same.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.3
• /
• pp.57-64
• /
• 2021

The domestic semiconductor industry can produce various products that will satisfy customer needs by diversifying assembly parts and increasing compatibility between them. It is necessary to improve the production line as a method to reduce the work-in-process inventory (WIP) in the assembly line, the idle time of the worker, and the idle time of the process. The improvement of the production line is to balance the capabilities of each process as a whole, and to determine the timing of product input or the order of the work process so that the time required between each process is balanced. The purpose of this study is to find the optimal WIP and buffer size through SA (Simulated Annealing) that minimizes lead time while matching the number of two parts in a parallel assembly line with bottleneck process. The WIP level and buffer size obtained by the SA algorithm were applied to the CONWIP and DBR systems, which are the existing production systems, and the simulation was performed by applying them to the new hybrid production system. Here, the Hybrid method is a combination of CONWIP and DBR methods, and it is a production system created by setting new rules. As a result of the Simulation, the result values were derived based on three criteria: lead time, production volume, and work-in-process inventory. Finally, the effect of the hybrid production method was verified through comparative analysis of the result values.

• Journal of Communications and Networks
• /
• v.2 no.1
• /
• pp.5-17
• /
• 2000

cdma2000 offers several enhancement as compared to TIA/EIA-95, although it remains fully compatible with TIA/EIA-95 systems and allows for a smooth migration from one to the other-Major new capability include:1)connectivity to GSM-MAP in addition to IP and IS-41 networks; 2) new layering with new LAC and MAC architectures for improved service multiplexing and QoS management and efficient use of radio resource ;3) new bands and band widths of operation in support of various operator need and constraints, as well as desire for a smooth and progressive migration to cdma 2000; and 4) flexible channel structure in support of multiple services with various QoS and variable transmission rates at up to 1 Mbps per channel and 2 Mbps per user. Given the phenomenal success of wireless services and desire for higher rate wireless services. improved spectrum efficiency was a major design goal in the elaboration of cdma2000. Major capacity enhancing features include; 1) turbo coding for data transmission: 2)fast forward link power control :3) forward link transmit diversity; 4) support of directive antenna transmission techniques; 5) coherent reverse link structure; and 6) enhanced access channel operation. As users increasingly rely on their cell phone at work and at home for voice and data exchange, the stand-by time and operation-time are essential parameters that can influence customer's satisfaction and service utilization. Another major goal of cdma2000 was therefore to enable manufacturers to further optimize power utilization in the terminal. Major battery life enhancing features include; 1) improved reverse link performance (i.e., reduced transmit power per information bit; 2) new common channel structure and operation ;3) quick paging channel operation; 4) reverse link gated transmission ; and 5) new MAC stated for efficient and ubiquitous idle time idle time operation. this article provides additional details on those enhancements. The intent is not to duplicate the detailed cdma2000 radio access network specification, but rather to provide some background on the new features of cdma2000 and on the qualitative improvements as compared to the TIA/EIA-95 based systems. The article is focused on the physical layer structure and associated procedures. It therefore does not cover the MAC, LAC, radio resource management [1], or any other signaling protocols in any detail. We assume some familiarity with the basic CDMA concepts used in TIA/EIA-95.

• Journal of Navigation and Port Research
• /
• v.33 no.10
• /
• pp.715-722
• /
• 2009

In Automated Container Terminal, the remarshaling is the task of rearranging containers for the effective exporting operations. Since available time for the remarshaling is usually restricted, all containers cannot be remarshaled. Therefore, this paper proposes a method that selects some containers from all export containers and then establishes the remarshaling plan with only the selected containers. The experimental results using simulation system shows that our proposal planning method that plans after selecting remarshaling containers is better than plans with all loading containers and remarshals during the available time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.2
• /
• pp.36-42
• /
• 2008

As competition shifts from being a company oriented one to a supply chain oriented, an effective SCM(supply chain management) becomes a necessary strategy for any successful businesses. But, it is not easy to form a successful SCM, because the individual desire of participants conflict with others. These desires affect the performance of SCM and cause waste of cost and time. Analyzing a supply chain of discount retailers, this paper eliminates idle time and improves the process with rearranging the reorder closing time(reorder point). For win-win strategy, this work reveals the reorder closing time is an important factor. It is possible to reduce cost and time on the entire SCM process by just changing the ordering time.