• IE interfaces
• /
• v.10 no.1
• /
• pp.15-22
• /
• 1997

In semiconductor manufacturing, the probe process between fabrication and assembly process is constrained mostly by the equipment capacity because most products pass through the similar procedures. The probe process is usually performed in a batch mode with relatively short cycle times. The capability of the probe process can be determined by the optimal combination of the equipments and the products. A probe line usually has several types of equipment with different capacity. In this study, the probe line is modeled in terms of capacity to give the efficient planning and control procedure. For the practical usage, the hierarchical capacity planning procedure is used. First, a monthly capacity plan is made to meet the monthly production plan of each product. Secondly, the daily capacity planning is performed by considering the monthly capacity plan and the daily fabrication output. Simple heuristic algorithms for daily capacity planning are developed and some experimental results are shown.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• Journal of Applied Reliability
• /
• v.12 no.3
• /
• pp.225-238
• /
• 2012

In this paper determined is the quantity of repairable concurrent spare parts(CSP) of a new equipment system to maximize the operational availability under budget constraint and cannibalization allowed. When a part fails, the part is replaced and the failed part is repaired for later use while cannibalization is allowed. The failure of a part is assumed to follow a Poisson process and the availability in CSP is defined. The solution procedure consists of two parts. Firstly, a mathematical model is developed under the assumption that the failure rate is constant during the CSP period and cannibalization is not allowed. Secondly, proposed is a simulation search procedure which improves the heuristic solution to the near optimal solution in a reasonable amount of time under the assumption that the cannibalization is allowed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.37-46
• /
• 1990

Biomass to methane production is a good supply of substitutable energy resources. The economic viability of these systems depends a great deal on cost effective production methods and facilities. The operational problem is to determine the time eto allocate to each batch of several feedstocks for each digester and to determine the number of batches for each digester so as to maximize biogas production for two identical digesters over a fixed planning horizon. This paper provides an efficient approximation procedure which is based on decomposition of the problem and the analysis of incremental gas production function for each feedstock. The computational experience for the heuristic procedure was also reported.

• Journal of Applied Reliability
• /
• v.4 no.2
• /
• pp.91-104
• /
• 2004

In this paper we consider the concurrent spare part(CSP) requirements problem of new equipment system. When a part fails, the part is replaced and the repair of failed part is impossible and cannibalization is allowed. We assume that the failure of a part knows a Poisson process. The operational availability concept in CSP is defined, and derive a formula to calculate the operational availability using expected machine operating time during CSP period. A mathematical model is derived for making an CSP requirement determination subject to the constraint of satisfying any given operational availability limitation and an heuristic solution search procedure is derived. An illustrative example is shown to explain the solution procedure.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.14 no.1
• /
• pp.44-50
• /
• 2015

This paper presents a heuristic process-optimization procedure for minimizing warpage in injection-molded parts based on the dynamic robust design methodology. The injection molding process is known to have intrinsic variations of its process conditions due to various factors, including incomplete process control facilities. The aim of the robust design methodology advocated by Taguchi is to determine the optimum design variables in a system which is robust to variations in uncontrollable factors. The proposed procedure can determine the optimal robust conditions of injection molding processes at a minimum cost through a trade-off strategy between the degree of warpage and the packing time.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.866-870
• /
• 2010

This paper presents a application of Harmony Search (HS) algorithm for optimal placement of distributed generations(DGs) in distribution systems. In optimization procedure, the HS algorithm denotes the searching ability for the global optimal solution with simple coding of the iteration procedure, and shows the fast convergence characteristics for getting solutions. The HS algorithm is tested on 9 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate placement points of DGs and reducing amount of active power without the occurrence of any mis-determination in selection of its capacity.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.97-104
• /
• 2005

Considered is the concurrent spare part(CSP) requirements problem of new equipment system. In the considered system, when a part fails, the part cannot be repaired and should be replaced. In addition, cannibalization is allowed. It is assumed that the failure of a part follows a Poisson process. The operational availability concept in CSP is defined, and a formula is derived to calculate the operational availability using expected machine operating time during CSP period. The problem is formulated as the operational availability maximization problem with available budget constraint and a heuristic solution search procedure is developed. An illustrative example is shown to explain the solution procedure.