Sun Hur

Prof. Sun Hur

Department of Industrial and Management Engineering, Hanyang University, Ansan 15588, Korea
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
22 November 2015 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
Biswajit SarkarBiswajit Sarkar
Biswajit Sarkar
Sharmila SarenSharmila Saren
Sharmila Saren
DSDebjani Sinha
Debjani Sinha
Sun HurSun Hur
Sun Hur
Due to heavy transportation for single-setup multidelivery (SSMD) policy in supply chain management, this model assumes carbon emission cost to obtain a realistic behavior for world environment. The transportation for buyer and vendor is considered along with setup cost reduction by using an investment function. It is assumed that the shipment lot size of each delivery is unequal and variable. The buyer inspects all received products and returns defective items to vendor for reworking process. Because of this policy, end customers will only obtain nondefective items. The analytical optimization is considered to obtain the optimum solution of the model. The main goal of this paper is to reduce the total cost by considering carbon emission during the transportation. A numerical example, graphical representation, and sensitivity analysis are given to illustrate the model.

1 April 2020 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
GAGilseung Ahn
Gilseung Ahn
Sun HurSun Hur
Sun Hur

16 September 2020 in RAIRO - Operations Research
Verified
Journal Article
Closed access
PDF file
Biswajit SarkarBiswajit Sarkar
Biswajit Sarkar
Bikash Koli DeyBikash Koli Dey
Bikash Koli Dey
MSMitali Sarkar
Mitali Sarkar
Sun HurSun Hur
Sun Hur
BMBuddhadev Mandal
Buddhadev Mandal
VDVinti Dhaka
Vinti Dhaka
In this study one obtained the optimal decision of a retailer for the replenishment rate with selling-price and credit-period dependent demand to maximize the profit. A time-varying deterioration rate was considered for those products. A credit-period was offered by the retailer to the end customer to settle the whole payments. The aim of the model was to obtain the maximum profit for the retailer based model. A solution methodology with an algorithm was used to obtain the global optimum profit. An illustrative numerical example was given to test the practical applicability of the model. Numerical study indicated that the profit was at a maximum when the permissible delay-period for payment offered by the suppliers was lies between the permissible delay-time, and the cycle time, offered by the retailer.

30 April 2004 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
Sun HurSun Hur
Sun Hur
YLYoung Hae Lee
Young Hae Lee
SLSi Yeong Lim
Si Yeong Lim
MLMoon Hwan Lee
Moon Hwan Lee

22 March 2018 in International Journal of Production Research
Verified
Journal Article
Closed access
GAGilseung Ahn
Gilseung Ahn
You-Jin ParkYou-Jin Park
You-Jin Park
Sun HurSun Hur
Sun Hur
Task composition in cloud manufacturing involves the selection of appropriate services from the cloud manufacturing platform and combining them to process the task with the purpose of achieving its expected performance. Calculation methods for achieving the performance expected by customers when the task has two or more composition patterns (e.g. sequential and switching pattern) are necessary because most tasks have multiple composition patterns in cloud manufacturing. Previous studies, however, have focused only on a single composition pattern. In this paper, we regard a task as a directed acyclic graph, and propose graph-based algorithms to obtain cost, execution time, quality and reliability of a task having multiple composition patterns. In addition, we model the task composition problem by introducing cost and execution time as performance attributes, and quality and reliability as basic attributes in the Kano model. Finally, an experiment to compare the performances of three metaheuristic algorithms (namely, variable neighbourhood search, genetic, and simulated annealing) is conducted to solve the problem. The experimental result shows that the variable neighbourhood search algorithm yields better and more stable solutions than the genetic algorithm and simulated annealing algorithms.

6 July 2020 in Processes
Verified
Journal Article
Open access
PDF file
GAGilseung Ahn
Gilseung Ahn
HLHwanchul Lee
Hwanchul Lee
JPJisu Park
Jisu Park
Sun HurSun Hur
Sun Hur
Diagnosis of bearing faults is crucial in various industries. Time series classification (TSC) assigns each time series to one of a set of pre-defined classes, such as normal and fault, and has been regarded as an appropriate approach for bearing fault diagnosis. Considering late and inaccurate fault diagnosis may have a significant impact on maintenance costs, it is important to classify bearing signals as early and accurately as possible. TSC, however, has a major limitation, which is that a time series cannot be classified until the entire series is collected, implying that a fault cannot be diagnosed using TSC in advance. Therefore, it is important to classify a partially collected time series for early time series classification (ESTC), which is a TSC that considers both accuracy and earliness. Feature-based TSCs can handle this, but the problem is to determine whether a partially collected time series is enough for a decision that is still unsolved. Motivated by this, we propose an indicator of data sufficiency to determine whether a feature-based fault detection classifier can start classifying partially collected signals in order to diagnose bearing faults as early and accurately as possible. The indicator is trained based on the cosine similarity between signals that were collected fully and partially as input to the classifier. In addition, a parameter setting method for efficiently training the indicator is also proposed. The results of experiments using four benchmark datasets verified that the proposed indicator increased both accuracy and earliness compared with the previous time series classification method and general time series classification.