• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.60-68
• /
• 2009

Because of the reduced product life-cycle, industries are making an effort to bring down the process planning time. In the traditional approach, we have to analyze established process planning, then design the time chart based on process information and drawing the formal time chart such as SOP(sequence of operation). Thereafter, it will be converted to PLC code that is a time consuming and redundant job. Similarly, Industrial automated process uses PLC Code to control the factory; however, control information and control code(PLC code) are difficult to understand. Hence, industries prefer writing new control code instead of using the existing one. It shows the lack of information reusability in the existing process planning. As a result, to reduce this redundancy and lack of reusability, we propose SOS-Net modeling method. Unlike past stabilized process planning that is rigid to any change; our proposed SOS-Net modeling method is more adaptable to the new changes. The SOS-Net model is easy to understand and easy to convert into PLC Code accordingly. Therefore, we can easily modify the control information and reuse it for new process planning. The proposed model plays an intermediary role between process planning and PLC code generation. It can reduce the process planning and implementation time as well as cost.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.327-329
• /
• 2023

순서 의존적 준비시간을 갖는 단일기계 생산라인에서 주어진 작업들을 효율적으로 수행하기 위해서는 최대한 동일하거나 유사한 유형의 작업물들을 연속적으로 처리하여 다음 번 작업물의 처리를 시작하기 전에 발생하는 준비시간을 최소화하여야 한다. 따라서, 대기 중인 것들 중 기계에 투입할 작업물을 적절히 선택하는 것이 중요하며, 이를 위해 작업 배정 규칙과 같은 휴리스틱을 사용할 수도 있지만, 이러한 해법들은 일반적으로 다양한 상황을 동적으로 고려하지 못하는 한계점을 갖는다. 따라서, 본 논문에서는 상용 3D 시뮬레이션 소프트웨어인 FlexSim을 사용하여 모형을 구성한 다음, 강화학습을 적용하여 대기 중인 작업물 중 최적의 후보를 선택하기 위한 작업 배정 모형을 개발하고자 한다. 세부적으로는 강화학습의 상태 및 보상을 달리 설정하면서 학습된 모형의 성능을 비교하고자 한다. 실험 결과를 통해 적절한 시뮬레이션 모형 구성과 강화학습의 파라미터 변수들을 적절히 조합하여 적절한 작업 배정 모형의 개발이 가능하다는 점을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1502-1520
• /
• 2021

This paper attempts to investigate Korean youth Not in Education, Employment and Training (NEET) and how daily activities and community participation may influence their positive emotions and job search desire. First, we conducted a focus group interview with 16 NEETs who participated in the Kakao NEET Company project. The project allowed participants to experience employment by founding a virtual company in which each participant selected a daily activity to perform as part of the company's operations. Second, the interview responses were categorized and assigned emotional values using the card sorting technique and multi-dimensional analysis (MDS). A total of 11 emotional values were derived through this process. Finally, a social network analysis was conducted in order to measure the density of relations among the emotional values. Results suggest that immersion, confidence, belongingness were the three highest values evaluated by participants. Furthermore, network diagrams imply that the stronger participants perceived social support and belongingness with others, the stronger their responsibility grew, further leading them to establish steady goals. In particular, the high eigenvector score for "desire for job" suggests that emotional values are sequentially connected to the immersion-social support-responsibility-goal-job desire. This sequence suggests that digital services that are developed with the aim to enhance social values such as the Kakao NEET Project may engender motivation and confidence in youth NEETs. The overall results suggest that a systematic approach to policymaking should be considered in order to provide fundamental solutions and expand opportunities for social participation and emotional comfort, as social isolation due to low self-esteem has been reported as one of the reasons for NEETs' failure in the labor market.

• Korean Journal of Social Welfare
• /
• v.65 no.1
• /
• pp.201-226
• /
• 2013

This study aims to identify changes in early work career of youth cohort entering the labor market pre and post-the economic crisis and compare career pathway types of different cohorts. Labor market experiences of youth cohort were constructed by sequencing the number of organizations, kinds of jobs, the scale of the business, and type of employment. In addition, a holistic sequence was created by including complementary factors. In this sense, the labor market experience in this study was conceptualized as a process involving continuous sequences and hierarchical and orderly changes which differs from a simple job mobility. Sequence analysis involving Optimal Matching method was conducted to examine whether such cohort-differences in labor market experiences were related to differences in distribution of career pathway types. The result showed that the post-economic crisis cohort had a relatively higher likelihood of falling into the non-employment type, unemployment type, non-corporate employment type, irregular employment type, and mobile employment type. These findings provide empirical evidence supporting the hypothesis that the employment precariousness of cohort has exacerbated after the economic crisis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.163-163
• /
• 1988

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• IE interfaces
• /
• v.15 no.4
• /
• pp.338-348
• /
• 2002

In this paper, we present a restricted tabu search(RTS) algorithm that schedules jobs on identical parallel machines in order to minimize the maximum lateness of jobs. Jobs have release times and due dates. Also, sequence-dependent setup times exist between jobs. The RTS algorithm consists of two main parts. The first part is the MATCS(Modified Apparent Tardiness Cost with Setups) rule that provides an efficient initial schedule for the RTS. The second part is a search heuristic that employs a restricted neighborhood generation scheme with the elimination of non-efficient job moves in finding the best neighborhood schedule. The search heuristic reduces the tabu search effort greatly while obtaining the final schedules of good quality. The experimental results show that the proposed algorithm gives better solutions quickly than the existing heuristic algorithms such as the RHP(Rolling Horizon Procedure) heuristic, the basic tabu search, and simulated annealing.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.163-175
• /
• 1996

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.159-166
• /
• 2006

The aim of synchronization of production and transportation planning in the supply chain is to increase the flexibility and to decrease various costs. The suggested model in this study synchronizes the timing to supply to a downstream manufacturer directly after production and to be consumed in a downstream manufacturer right after receipt. This model deals with the frequent delivery in small amount which is a new trend of the transportation not governed the economy of scale principle. Moreover, various types of transportation governed by the economy of scale principle or not are considered. Then, the two-phase mathematical model is suggested to obtain optimal job sequence and production quantity for each tasks. But, it is difficult to gain optimal solutions if there is a transportation governed by the economy of scale principle in the supply chain, or the size of the problem is increased. Thus, heuristic algorithms based on simulated annealing and genetic algorithm are suggested to find good solutions in the reasonable time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.213-220
• /
• 2007

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.283-293
• /
• 2007

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.