Sungyong Choi

Prof. Sungyong Choi

Hanyang University, Seoul, South Korea
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 April 2011 in Operations Research
Verified
Journal Article
Closed access
Sungyong ChoiSungyong Choi
Sungyong Choi
ARAndrzej Ruszczyński
Andrzej Ruszczyński
YZYao Zhao
Yao Zhao
We consider a multiproduct risk-averse newsvendor under the law-invariant coherent measures of risk. We first establish several fundamental properties of the model regarding the convexity of the problem, the symmetry of the solution, and the impact of risk aversion. Specifically, we show that for identical products with independent demands, increased risk aversion leads to decreased orders. For a large but finite number of heterogeneous products with independent demands, we derive closed-form approximations for the optimal order quantities. The approximations are as simple to compute as the classical risk-neutral solutions. We also show that the risk-neutral solution is asymptotically optimal as the number of products tends to be infinity, and thus risk aversion has no impact in the limit. For a risk-averse newsvendor with dependent demands, we show that positively (negatively) dependent demands lead to lower (higher) optimal order quantities than independent demands. Using a numerical study, we examine the convergence rates of the approximations and develop additional insights into the interplay between dependent demands and risk aversion.

1 January 2008 in Operations Research Letters
Verified
Journal Article
Closed access
Sungyong ChoiSungyong Choi
Sungyong Choi
ARAndrzej Ruszczyński
Andrzej Ruszczyński

1 October 2011 in European Journal of Operational Research
Verified
Journal Article
Closed access
Sungyong ChoiSungyong Choi
Sungyong Choi
ARAndrzej Ruszczyński
Andrzej Ruszczyński

MOminjeong oh
minjeong oh
Sungyong ChoiSungyong Choi
Sungyong Choi
The purpose of this paper is to examine the relationship between emotional, managerial, and intellectual competence of team members, which refer to the LDQ (Leadership Development Questionnaire) and impact on project success. (1) Background: Large and complex projects are being conducted in a dynamic business environment. The need for capabilities and managerial aspects of participants of the project for business performance increases. (2) Methods: A questionnaire survey was conducted on 164 project management professionals in various industries from Korea. The structural equation modeling technique was performed to establish the effect of competence of team members on project success factor. (3) Results: The results provided empirical support for the impact of team members’ competencies on project success factor. Moreover, there is no difference in the perception of the impact of team members’ competencies on project success factor, depending on their roles, such as project manager and team member. (4) Results: In this paper, the importance of the competence of team members in accordance with the project manager was presented. The findings of this study suggest the strategic direction of the members at this point when corporate innovation is needed.

5 December 2017 in Sustainability
Verified
Journal Article
Open access
PDF file
SSSangoh Shim
Sangoh Shim
KPKyungBae Park
KyungBae Park
Sungyong ChoiSungyong Choi
Sungyong Choi
Scheduling problems for the sustainability of manufacturing firms in the era of the fourth industrial revolution is addressed in this research. In terms of open innovation, innovative production scheduling can be defined as scheduling using big data, cyber-physical systems, internet of things, cloud computing, mobile network, and so on. In this environment, one of the most important things is to develop an innovative scheduling algorithm for the sustainability of manufacturing firms. In this research, a flexible flowshop scheduling problem is considered with the properties of sequence-dependent setup and different process plans for jobs. In a flexible flowshop, there are serial workstations with multiple pieces of equipment that are able to process multiple lots simultaneously. Since the scheduling in this workshop is known to be extremely difficult, it is important to devise an efficient and effective scheduling algorithm. In this research, a heuristic algorithm is proposed based on a few dispatching rules and economic lot size model with the objective of minimizing total tardiness of orders. For the purposes of performance evaluation, a simulation study is conducted on randomly generated problem instances. The results imply that our proposed method outperforms the existing ones, and greatly enhances the sustainability of manufacturing firms.

SSSangoh Shim
Sangoh Shim
KPKyungBae Park
KyungBae Park
Sungyong ChoiSungyong Choi
Sungyong Choi
This research addresses a specific issue in the field of operation scheduling. Even though there are lots of researches on the field of planning and scheduling, a specific scheduling problem is introduced here. We focus on the operation scheduling requirements that the Fourth Industrial Revolution has brought currently. From the point of view of open innovation, operation scheduling is known as the one that is using the Internet of Things, Cloud Computing, Big Data, and Mobile technology. To build proper operation systems under the Fourth Industrial Revolution, it is very essential to devise effective and efficient scheduling methodology to improve product quality, customer delivery, manufacturing flexibility, cost saving, and market competence. A scheduling problem on designated parallel equipments, where some equipments are grouped according to the recipe of lots, is considered. This implies that a lot associated with a specific recipe is preferred to be processed on an equipment among predetermined (designated) ones regardless of parallel ones. A setup operation occurs between different recipes of lots. In order to minimize completion time of the last lot, a scheduling algorithm is proposed. We conducted a simulation study with randomly generated problems, and the proposed algorithm has shown desirable and better performance that can be applied in real-time scheduling.