• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.112-119
• /
• 2017

Selecting suppliers in the global supply chain is the very difficult and complicated decision making problem particularly due to the various types of supply risk in addition to the uncertain performance of the potential suppliers. This paper proposes a multi-phase decision making model for supplier selection under supply risks in global supply chains. In the first phase, the model suggests supplier selection solutions suitable to a given condition of decision making using a rule-based expert system. The expert system consists of a knowledge base of supplier selection solutions and an "if-then" rule-based inference engine. The knowledge base contains information about options and their consistency for seven characteristics of 20 supplier selection solutions chosen from articles published in SCIE journals since 2010. In the second phase, the model computes the potential suppliers' general performance indices using a technique for order preference by similarity to ideal solution (TOPSIS) based on their scores obtained by applying the suggested solutions. In the third phase, the model computes their risk indices using a TOPSIS based on their historical and predicted scores obtained by applying a risk evaluation algorithm. The evaluation algorithm deals with seven types of supply risk that significantly affect supplier's performance and eventually influence buyer's production plan. In the fourth phase, the model selects Pareto optimal suppliers based on their general performance and risk indices. An example demonstrates the implementation of the proposed model. The proposed model provides supply chain managers with a practical tool to effectively select best suppliers while considering supply risks as well as the general performance.

• Journal of Soil and Groundwater Environment
• /
• v.27 no.2
• /
• pp.76-86
• /
• 2022

Calcium (Ca) and potassium (K) were introduced to remove Sr and Cs in soil, respectively. Four factor and three level Box-Bhenken design was employed to determine the optimal washing condition of Ca- and K-based solutions, and the ranges tested were 0.1 to 1 M of Ca or K, L/S ratio of 5 to 20, washing time of 0.5 to 2 h, and pH of 2 to 7. The optimal washing condition determined was 1 M of Ca or K, L/S ratio of 20, washing time of 1 h, and pH of 2, and Ca-based and K-based solutions showed 68 and 81% removal efficiency for Sr and Cs, respectively in soil. For comparison, widely used conventional washing agents such as 0.075 M EDTA, 0.01 M citric acid, 0.01 M oxalic acid, and 0.05 M phosphoric acid were tested, and they showed 25 to 30% of Sr and Cs removal efficiency. Tessier sequential extraction was employed to identify the changes in chemical forms of Sr and Cs during the washing. In contrast to the conventional washing agents, Ca-based and K-based solutions were able to release relatively strongly bound forms of Sr and Cs such as Fe/Mn-oxide and organic matter bound forms, suggesting the involvement of direct substitution mechanism, probably due to the physicochemical similarities between Sr-Ca and Cs-K.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.3
• /
• pp.185-193
• /
• 2009

We consider a two-fare, two-period airline seat capacity allocation problem where consumers may choose different options in purchasing an airline ticket. A consumer may decide to wait for reopening of the same fare class ticket which is originally intended to buy, or may buy a different fare class ticket within the same period, if the originally requested fare is unavailable. We investigate the impact of the consumer buying behavior on the optimal solutions and the expected revenue.

• 전기의세계
• /
• v.30 no.5
• /
• pp.297-305
• /
• 1981

The problem of finding shortest paths between every pair of points in a network is solved employing and optimal network decomposition in which the network is decomposed into a number of subnetworks minimizing the number of cut-set between them while each subnetwork is constrained by a size limit. Shortest path computations are performed on individual subnetworks, and the solutions are recomposed to obtain the solution of the original network. The method when applied to large scale networks significantly reduces core requirement and computation time. This is demonstrated by developing a computer program based on the method and applying it to 30-vertex, 160-vertex, and 273-vertex networks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.177-188
• /
• 1997

This study describes the important information for establishing Human Computer Interface System for solving the large scale Traveling Saleman Problem in Printed Circuit Board production. Appropriate types and sizes of partitioning of large scale problems are discussed. Optimal tours for the special patterns appeared in PCB's are given. The comparision of optimal solutions of non-Euclidean problems and Euclidean problems shows the possibilities of using human interface in solving the Chebyshev TSP. Algorithm for the large scale problem using described information and coputational result of the practical problem are given.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1157-1165
• /
• 2011

The Karush-Kuhn-Tucker (KKT) necessary optimality conditions for nonlinear differentiable programming problems are also sufficient under suitable convexity assumptions. The KKT conditions in multiobjective programming problems with interval-valued objective and constraint functions are derived in this paper. The main contribution of this paper is to obtain the Pareto optimal solutions by resorting to the sufficient optimality condition.

• Journal of the Korean Mathematical Society
• /
• v.43 no.5
• /
• pp.931-950
• /
• 2006

We study the identification problems of constant parameters appearing in the perturbed sine-Gordon equation with the Neumann boundary condition. The existence of optimal parameters is proved, and necessary conditions are established for several types of observations by utilizing quadratic optimal control theory due to Lions [13].

• Journal of the Korean Operations Research and Management Science Society
• /
• v.3 no.2
• /
• pp.95-108
• /
• 1978

This paper discusses an application of mathematical programming techniques in the paper industry in determining optimal parent roll widths. Parent rolls are made from the reels produced at wide paper machines by slitting them to more manageable widths. The problem is finding a set of the slitting patterns that will minimize the trim loss involved in the sheeting operation. Two programming models, one linear and one mixed integer linear, are presented in this paper. Also presented are the computational experience, the model sensitivity, and the comparison of the optimal solutions with the simulated operational data.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.95-105
• /
• 1986

This paper presents an adaptive algorithm to generate a near-optimal closed-loop solution for a non-zero sum differential game by periodically updating the solutions of the two-point boundary-value problem. Applications to competitive advertising problem show that the adaptive algorithm can be used as an efficient tool to solve the differential game problem in which one player may take advantage of the other's non-optimal play.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.71-79
• /
• 1993

Dynamic production planning problems are to determine the optimal production times and production quantities of product for discrete finite periods. In previous many researches, the solutions for these problems have been developed through the algorithms using dynamic programming. The purpose of this research is to suggest the new algorithm using linear programming. This research is to determine optimal production quantities of product in each period to satisfy dynamic for discrete finite periods, minimizing the total of production cost and inventory holding cost. Cost functions are concave, and no backlogging for product is allowed. The new algorithm for capacity constrained problem is developed.