This page has only limited features, please log in for full access.

Prof. Jong Soo Kim
Han Yang University

Basic Info


Research Keywords & Expertise

0 Inventory Control
0 Logistics
0 neural network
0 Mathematical optimization
0 machine learning

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 25 September 2020 in Mathematics
Reads 0
Downloads 0

This paper considers a multi-period supplier selection and order allocation problem for a green supply chain system that consists of a single buyer and multiple heterogeneous suppliers. The buyer sells multiple products to end customers and periodically replenishes each item’s inventory using a periodic inventory control policy. The periodic inventory control policy used by the buyer starts every period with an order size determination of each item and the subsequent supplier selection to fulfill the orders. Because each supplier in the system is different from other suppliers in the types of carrying items, delivery distance, item price, and quantity discount schedule, the buyer’s problem becomes a complicated optimization problem. For the described order size and supplier selection problem of the buyer, we propose a nonlinear integer programming model and develop two different algorithms to enhance the usability of the model in a real business environment with a large amount of data. The algorithms are developed to considerably cut computational time and at the same time to generate a good feasible solution to a given supplier selection and order allocation problem. Computational experiments that were conducted to test the efficiency of the algorithms showed that they can cut as much as 99% of the computational time and successfully find feasible solutions, deviating not more than 3.4% from the optimal solutions.

ACS Style

Shin Hee Baek; Jong Soo Kim. Efficient Algorithms for a Large-Scale Supplier Selection and Order Allocation Problem Considering Carbon Emissions and Quantity Discounts. Mathematics 2020, 8, 1659 .

AMA Style

Shin Hee Baek, Jong Soo Kim. Efficient Algorithms for a Large-Scale Supplier Selection and Order Allocation Problem Considering Carbon Emissions and Quantity Discounts. Mathematics. 2020; 8 (10):1659.

Chicago/Turabian Style

Shin Hee Baek; Jong Soo Kim. 2020. "Efficient Algorithms for a Large-Scale Supplier Selection and Order Allocation Problem Considering Carbon Emissions and Quantity Discounts." Mathematics 8, no. 10: 1659.

Journal article
Published: 15 June 2020 in Sustainability
Reads 0
Downloads 0

Recently, as global warming has become a major issue, many companies have increased their efforts to control carbon emissions in green supply chain management (GSCM) activities. This paper deals with the multi-item replenishment problem in GSCM, from both economic and environmental perspectives. A single buyer orders multiple items from a single supplier, and simultaneously considers carbon cap-and-trade under limited storage capacity and limited budget. In this case we can apply a can-order policy, which is a well-known multi-item replenishment policy. Depending on the market characteristics, we develop two mixed-integer programming (MIP) models based on the can-order policy. The deterministic model considers a monopoly market in which a company fully knows the market information, such that both storage capacity and budget are already determined. In contrast, the fuzzy model considers a competitive or a new market, in which case both of those resources are considered as fuzzy numbers. We performed numerical experiments to validate and assess the efficiency of the developed models. The results of the experiments showed that the proposed can-order policy performed far better than the traditional can-order policy in GSCM. In addition, we verified that the fuzzy model can cope with uncertainties better than the deterministic model in terms of total expected costs.

ACS Style

Jiseong Noh; Jong Soo Kim; Seung-June Hwang. A Multi-Item Replenishment Problem with Carbon Cap-And-Trade under Uncertainty. Sustainability 2020, 12, 4877 .

AMA Style

Jiseong Noh, Jong Soo Kim, Seung-June Hwang. A Multi-Item Replenishment Problem with Carbon Cap-And-Trade under Uncertainty. Sustainability. 2020; 12 (12):4877.

Chicago/Turabian Style

Jiseong Noh; Jong Soo Kim; Seung-June Hwang. 2020. "A Multi-Item Replenishment Problem with Carbon Cap-And-Trade under Uncertainty." Sustainability 12, no. 12: 4877.

Journal article
Published: 11 April 2020 in Mathematics
Reads 0
Downloads 0

Product demand forecasting plays a vital role in supply chain management since it is directly related to the profit of the company. According to companies’ concerns regarding product demand forecasting, many researchers have developed various forecasting models in order to improve accuracy. We propose a hybrid forecasting model called GA-GRU, which combines Genetic Algorithm (GA) with Gated Recurrent Unit (GRU). Because many hyperparameters of GRU affect its performance, we utilize GA that finds five kinds of hyperparameters of GRU including window size, number of neurons in the hidden state, batch size, epoch size, and initial learning rate. To validate the effectiveness of GA-GRU, this paper includes three experiments: comparing GA-GRU with other forecasting models, k-fold cross-validation, and sensitive analysis of the GA parameters. During each experiment, we use root mean square error and mean absolute error for calculating the accuracy of the forecasting models. The result shows that GA-GRU obtains better percent deviations than other forecasting models, suggesting setting the mutation factor of 0.015 and the crossover probability of 0.70. In short, we observe that GA-GRU can optimally set five types of hyperparameters and obtain the highest forecasting accuracy.

ACS Style

Jiseong Noh; Hyun-Ji Park; Jong Soo Kim; Seung-June Hwang. Gated Recurrent Unit with Genetic Algorithm for Product Demand Forecasting in Supply Chain Management. Mathematics 2020, 8, 565 .

AMA Style

Jiseong Noh, Hyun-Ji Park, Jong Soo Kim, Seung-June Hwang. Gated Recurrent Unit with Genetic Algorithm for Product Demand Forecasting in Supply Chain Management. Mathematics. 2020; 8 (4):565.

Chicago/Turabian Style

Jiseong Noh; Hyun-Ji Park; Jong Soo Kim; Seung-June Hwang. 2020. "Gated Recurrent Unit with Genetic Algorithm for Product Demand Forecasting in Supply Chain Management." Mathematics 8, no. 4: 565.

Journal article
Published: 03 March 2020 in Symmetry
Reads 0
Downloads 0

With the ever-growing technology development, high-tech products such as mobile phones, computers, electromagnetic devices and smart devices are facing high design and production modification requirements with relatively shorter life cycles. For instance, every forthcoming smart phone goes out of production in a shorter period after its launch, followed by its next generation. The design of high-tech products requires high investments in smart and automated manufacturing technology to ensure higher production efficiency. For high-tech products with short life spans, the manufacturing performance-quality variable is an important design parameter that affects system reliability, production efficiency and manufacturing costs. Major performance-quality factors of a manufacturing system which affect productivity and reliability of the manufacturing process are discussed in this research. The study investigates an integrated smart production maintenance model under stochastic manufacturing reliability for technology dependent demand and variable production rate. The smart unit production cost is a function of manufacturing reliability and controllable production rate, as a manufacturing system can be operated at different production rates within designed limits μ ϵ [ μ m i n , μ m a x ] . Manufacturing reliability is increased through investment in smart manufacturing technology and resources. The integrated smart production maintenance model is formulated under general failure and repair time distributions and the optimal production maintenance policy is investigated under specific failure and repair time distributions. A mathematical model is developed to optimize the manufacturing quality-performance parameter, variable production rate, per unit technology investment and production lot size. The total cost function is optimized through the Khun–Tucker method. The mathematical model is also validated with numerical analysis, comparative study, and sensitivity analysis for model key parameters.

ACS Style

Iqra Asghar; Jong Soo Kim. An Automated Smart EPQ-Based Inventory Model for Technology-Dependent Products under Stochastic Failure and Repair Rate. Symmetry 2020, 12, 388 .

AMA Style

Iqra Asghar, Jong Soo Kim. An Automated Smart EPQ-Based Inventory Model for Technology-Dependent Products under Stochastic Failure and Repair Rate. Symmetry. 2020; 12 (3):388.

Chicago/Turabian Style

Iqra Asghar; Jong Soo Kim. 2020. "An Automated Smart EPQ-Based Inventory Model for Technology-Dependent Products under Stochastic Failure and Repair Rate." Symmetry 12, no. 3: 388.

Journal article
Published: 13 December 2018 in Mathematics
Reads 0
Downloads 0

We consider a buyer’s decision problem of sustainable supplier selection and order allocation (SSS & OA) among multiple heterogeneous suppliers who sell multiple types of items. The buyer periodically orders items from chosen suppliers to refill inventory to preset levels. Each supplier is differentiated from others by the types of items supplied, selling price, and order-related costs, such as transportation cost. Each supplier also has a preset requirement for minimum order quantity or minimum purchase amount. In the beginning of each period, the buyer constructs an SSS & OA plan considering various information from both parties. The buyer’s planning problem is formulated as a mathematical model, and an efficient algorithm to solve larger instances of the problem is developed. The algorithm is designed to take advantage of the branch-and-bound method, and the special structure of the model. We perform computer experiments to test the accuracy of the proposed algorithm. The test result confirmed that the algorithm can find a near-optimal solution with only 0.82 percent deviation on average. We also observed that the use of the algorithm can increase solvable problem size by about 2.4 times.

ACS Style

Jong Soo Kim; Eunhee Jeon; Jiseong Noh; Jun Hyeong Park. A Model and an Algorithm for a Large-Scale Sustainable Supplier Selection and Order Allocation Problem. Mathematics 2018, 6, 325 .

AMA Style

Jong Soo Kim, Eunhee Jeon, Jiseong Noh, Jun Hyeong Park. A Model and an Algorithm for a Large-Scale Sustainable Supplier Selection and Order Allocation Problem. Mathematics. 2018; 6 (12):325.

Chicago/Turabian Style

Jong Soo Kim; Eunhee Jeon; Jiseong Noh; Jun Hyeong Park. 2018. "A Model and an Algorithm for a Large-Scale Sustainable Supplier Selection and Order Allocation Problem." Mathematics 6, no. 12: 325.

Original paper
Published: 11 April 2018 in Operational Research
Reads 0
Downloads 0

This paper concerns the joint replenishment problem for a single buyer who sells multiple types of items to end customers. The buyer periodically replenishes the item inventory to order-up-to levels to cover the end customers’ demands, which may be non-stationary. A joint replenishment policy characterized by a variable order-up-to level is proposed for buyers who wish to minimize the expected cost of operating the inventory system. According to the proposed policy, each period starts with calculation of the expected cost of two options, ordering and not ordering each item, based on a current inventory position and forecasted demand for the upcoming period. The proposed policy then uses an integer-programming model to generate a cost-minimizing decision for the joint replenishment. A computer experiment was performed to test the efficiency of the proposed policy. When compared with the most efficient policy currently available, our policy yielded considerable cost savings, especially for non-stationary demands.

ACS Style

Young Hyeon Yang; Jong Soo Kim. An adaptive joint replenishment policy for items with non-stationary demands. Operational Research 2018, 20, 1665 -1684.

AMA Style

Young Hyeon Yang, Jong Soo Kim. An adaptive joint replenishment policy for items with non-stationary demands. Operational Research. 2018; 20 (3):1665-1684.

Chicago/Turabian Style

Young Hyeon Yang; Jong Soo Kim. 2018. "An adaptive joint replenishment policy for items with non-stationary demands." Operational Research 20, no. 3: 1665-1684.

Original paper
Published: 05 December 2016 in Operational Research
Reads 0
Downloads 0

This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer’s order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer’s perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer’s total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem.

ACS Style

Jiseong Noh; Jong Soo Kim; Biswajit Sarkar. Stochastic joint replenishment problem with quantity discounts and minimum order constraints. Operational Research 2016, 19, 151 -178.

AMA Style

Jiseong Noh, Jong Soo Kim, Biswajit Sarkar. Stochastic joint replenishment problem with quantity discounts and minimum order constraints. Operational Research. 2016; 19 (1):151-178.

Chicago/Turabian Style

Jiseong Noh; Jong Soo Kim; Biswajit Sarkar. 2016. "Stochastic joint replenishment problem with quantity discounts and minimum order constraints." Operational Research 19, no. 1: 151-178.