Jiseong Noh

Jiseong Noh

Auto-generated profile, based on publicly available information

Jiseong Noh

Institute of Knowledge Services, Hanyang University, Erica, Ansan 15588, Korea

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Journal of Cleaner Production
Verified
Journal Article
Closed access
JNJiseong Noh
Jiseong Noh
JKJong Soo Kim
Jong Soo Kim

1 January 2019 in European J. of Industrial Engineering
Verified
Journal Article
Closed access
JNJiseong Noh
Jiseong Noh
JKJong Soo Kim
Jong Soo Kim
Biswajit SarkarBiswajit Sarkar
Biswajit Sarkar
This paper develops a two-echelon supply chain model with a single manufacturer and a single retailer, where the demand is sensitive to advertising and retail price. To resolve the supply chain coordination, three strategies are introduced as retailer leader-manufacturer follower, manufacturer leader-retailer follower, and centralised supply chain. Based on these strategies, this paper suggests an optimal production rate, a production lot size, shortage level, an advertising expenditure, and retail price. Stackelberg approach is employed for solving leader-follower game to obtain the maximum profit of both manufacturer and retailer. The improved algorithm is developed to obtain the numerical results. For testing the model, this paper considers several numerical experiments, graphical illustrations, and sensitivity analysis. The result shows that the strategy of retailer leader-manufacturer follower obtains the highest profit than other strategies. [Received: 23 September 2017; Revised: 28 November 2017; Revised: 29 April 2018; Revised: 19 July 2018; Revised: 21 October 2018; Accepted: 21 October 2018]

11 April 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
JNJiseong Noh
Jiseong Noh
HPHyun-Ji Park
Hyun-Ji Park
JKJong Soo Kim
Jong Soo Kim
SHSeung-June Hwang
Seung-June Hwang
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.

5 December 2016 in Operational Research
Verified
Journal Article
Closed access
PDF file
JNJi Seong Noh
Ji Seong Noh
JKJong Soo Kim
Jong Soo Kim
Biswajit SarkarBiswajit Sarkar
Biswajit Sarkar

13 December 2018 in Mathematics
Verified
Journal Article
Open access
PDF file
JKJong Soo Kim
Jong Soo Kim
EJEunhee Jeon
Eunhee Jeon
JNJiseong Noh
Jiseong Noh
JPJun Hyeong Park
Jun Hyeong Park
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.

16 January 2023 in Systems
Verified
Journal Article
Open access
PDF file
JNJiseong Noh
Jiseong Noh
SHSeung-June Hwang
Seung-June Hwang
In energy supply chain management (ESCM), the supply chain members try to make long-term contracts for supplying energy stably and reducing the cost. Currently, optimizing ESCM is a complex problem with two social issues: environmental regulations and uncertainties. First, environmental regulations have been tightened in countries around the world, leading to eco-friendly management. As a result, it has become imperative for the energy buyer to consider not only the total operating cost but also carbon emissions. Second, the uncertainties, such as pandemics and wars, have had a serious impact on handling ESCM. Since the COVID-19 pandemic disrupted the supply chain, the supply chain members adopted emergency procurement for sustainable operations. In this study, we developed an optimization model using mixed-integer linear programming to solve ESCM with supplier selection problems in emergency procurement. The model considers a single thermal power plant and multiple fossil fuel suppliers. Because of uncertainties, energy demand may suddenly change or may not be supplied on time. To better manage these uncertainties, we developed a rolling horizon method (RHM), which is a well-known method for solving deterministic problems in mathematical programming models. To test the model and the RHM, we conducted three types of numerical experiments. First, we examined replenishment strategies and schedules under uncertain demands. Second, we conducted a supplier selection experiment within a limited budget and carbon emission regulations. Finally, we conducted a sensitivity analysis of carbon emission limits. The results show that our RHM can handle ESCM under uncertain situations effectively.