• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.86-96
• /
• 2015

In mobile communication, mobile services [MSs] (e.g., phone calls, short/multimedia messages, and Internet data) incur a cost to both mobile users (MUs) and mobile service providers (MSPs). The proposed model MobPrice consists of dynamic data pricing schemes for mobile communication in order to achieve optimal usage of MSs at minimal prices. MobPrice inspires MUs to subscribe MSs with flexibility of data sharing and intra-peer exchanges, thereby reducing overall cost. The main contributions of MobPrice are three-fold. First, it proposes a novel k-level data-pricing (kDP) scheme for MSs. Second, it extends the kDP scheme with the notion of service-sharing-based pricing schemes to a collaborative peer-to-peer data-pricing (pDP) scheme and a cluster-based data-pricing (cDP) scheme to incorporate the notion of 'cluster' (made up of two or more MUs) in mobile communication. Third, our performance study shows that the proposed schemes are indeed effective in maximizing MS subscriptions and minimizing MS's price/user.

• Proceedings of the Korean Reliability Society Conference
• /
• 2005.06a
• /
• pp.121-129
• /
• 2005

In this paper, we consider a periodic preventive maintenance(PM) policy in which each PM reduces the hazard rate of amount proportional to the failure intensity, which increases since the last PM and slows down the wear-out speed to that of new one. And the proportion of reduction in hazard rate decreases with the number of PMs. Our model is similar to $ARI_1$ proposed by Doyen and Gaudoin(2004) in the sense of reduction of hazard rate. Our model has totally different wear-out pattern of hazard rate after PM's, however, and the proportion of reduction depends on the number of PM's. Assuming that the system undergoes only minimal repairs at failures between PM's, the expected cost rate per unit time is obtained. The optimal number N of PM and the optimal period x, which minimize the expected cost rate per unit time are discussed. Explicit solutions for the optimal periodic PM are given for the Weibull distribution case.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.25
• /
• pp.41-51
• /
• 1992

Most of the planing models for automated manufacturing systems are based on the assumption that for each part there is only one process method available Really. for a part to be manufactured in an automated manufacturing system, a number of different process methods can be generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers and feeders. In this paper, An optimal algorithm for the selection of a set of process methods with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices Is proposed. The proposed optimal algorithm is based on branch and bound method which is one of the optimal solution methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.293-299
• /
• 1996

The breakdown of machines lead to the lateness of parts and the change of schedules. Its treatment is very important problem in the shop floor control system. In this study, we present an algorithm minimize the lateness, earliness and change of schedule by controlling machining speed of available machines. Production time and production cost required to manufacture a piece of product are usually expressed as a unimodal convex fuction with respect to machining speed, and each has its minimal point at the minimum time speed or the minimum cost speed, and a speed range between these two speeds is called 'efficiency speed range'. Therefore, the algorithm determines the machining speed in the efficiency speed range. An example is demonstrated to explain the algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.87-92
• /
• 1995

This paper proposes age replacement policy in stepdown warranty policy. The replacement policy is considered in case of minimally repairable items. And renewal theory is used in analyzing warranty costs. The expected cost per unit time is presented in stepdown warranty policy, free replacement, prorata and hybrid policy. In this article it is assumed that item is replaced at the age of T but the any failure is minimally repaired before the age T. At this point the expected cost per unit time is shown in customer's view point. And numerical example is explored in weibull time-to-failure distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.6079-6097
• /
• 2018

Safety-related systems (SRSs) has widely used in shipbuilding and power generation to prevent fatal accidents and to protect life and property. Thus, SRS performance is a high priority. The safety integrity level (SIL) is the relative performance level of an SRS with regard to its ability to operate reliably in a safe manner. In this article, we proposed an optimal design procedure to achieve the targeted SIL of SRSs. In addition, a more efficient failure mode and effects diagnostic analysis (FMEDA) process and optimization model were developed to improve cost efficiency. Based on previous IEC 61508 diagnostic analyses that revealed unnecessary costs associated with excessive reliability, the new approach consists of two phases: (i) SIL evaluation by FMEDA, and (ii) solution optimization for achieving the target SIL with minimal cost using integer-programming models. The proposed procedure meets the required safety level and minimizes system costs. A case study involving a gas-detection SRS was conducted to demonstrate the effectiveness of the new procedure.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3E
• /
• pp.37-43
• /
• 1999

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.209-214
• /
• 2018

This paper suggests simple algorithm of facility location problem in perishable commodities that satisfy with minimum total transportation cost and within the transportation time constraint $L^*$. For this problem, Lee[4] suggests very complex algorithm that decides candidate facility locations, computes total transportation cost for each candidate facility location, then moving the location to optimal location for top two facilities. On the other hand, this paper simply determines the candidate facility locations within $L^*$ using subtree concept, and decides optimal minimal total transportation cost for top two locations in centralized area of required quantity using neighborhood concept.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.388-393
• /
• 2005

Private peering, public peering and transit are three common types of interconnection agreements between providers in the Internet. An important decision that an Internet service provider (ISP) has to make is which private peering/transit ISPs and Internet exchanges (IXs) to connect with to transfer traffic at a minimal cost. In this paper, we deal with the problem to find the minimum cost set of private peering/transit ISPs and IXs for a single ISP. There are given a set of destinations with traffic demands, and a set of potential private peering/transit ISPs and IXs with routing information (routes per destination, the average AS-hop count to each destination, etc.), cost functions and capacities. Our study first considers all the three interconnection types commonly used in real world practices. We show that the problem is NP-hard, and propose a heuristic algorithm for it. We then evaluate the quality of the heuristic solutions for a set of test instances via comparison with the optimal ones obtained by solving a mixed integer programming formulation of the problem. Computational results show that the proposed algorithm provides near-optimal solutions in a fast time.

• Smart Structures and Systems
• /
• v.22 no.2
• /
• pp.151-159
• /
• 2018

Maintenance activities are regarded as a key part of the repairable deteriorating system because they maintain the equipment in good condition. In practice, many maintenance policies are used in engineering fields to reduce unexpected failures and slow down the deterioration of the system. However, in traditional maintenance policies, maintenance activities have often been assumed to be performed at the same time interval, which may result in higher operational costs and more system failures. Thus, this study presents two non-periodic preventive maintenance (PM) policies for repairable deteriorating systems, employing the failure rate of the system as a conditional variable. In the proposed PM models, the failure rate of the system was restored via the failure rate reduction factors after imperfect PM activities. Operational costs were also considered, which increased along with the operating time of the system and the frequency of PM activities to reflect the deterioration process of the system. A numerical example was provided to illustrate the proposed PM policy. The results showed that PM activities performed at a low failure rate threshold slowed down the degradation of the system and thus extended the system lifetime. Moreover, when the operational cost was considered in the proposed maintenance scheme, the system replacement was more cost-effective than frequent PM activities in the severely degraded system.