• Korean Journal of Social Welfare Studies
• /
• v.44 no.3
• /
• pp.323-346
• /
• 2013

The main purpose of this study is to analyze job sequences according to poverty profiles that the working poor have had. For the stated purpose, this study examines characteristics and patterns of job sequences by diving the subgroups, using the 10 year data of KLIPS and the sequence analysis. Major findings are as follows. The working-transient poor have different characteristics, such as longer working term, less job change, less number of gap and length, and relatively higher monthly income, from the working-recurrent poor and the working-persistent poor. However, there are no different characteristics between the working-recurrent poor and working-persistent poor, except for monthly income. Job sequences are divided into 5 clusters and job sequences types according to the working poor subgroups are quite different. Such analysis results would contribute to planning poverty policies based on job sequences differently seen in subgroups and finding specific policy alternatives to relieve the working poor.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.85-88
• /
• 2003

In case that any jobs in a Job Shop can be scheduled on more than one machine and may have flexible operation sequences, with considering such case it is very difficult and complex to make the optimal process plans and scheduling. But they should be considered for an integrated model to perform more effective process planning and scheduling in this job shop problem. In this paper, we propose GA-based scheduling method to integrate effectively the problem of alternative machines, alternative operation sequences and scheduling. The performance of proposed GA is evaluated through comparing integrated scheduling with not integrated scheduling in molding company with alternative machines and operation sequences. Also, we use benchmark problems to evaluate performance. The scheduling method in this research will apply usefully to real world scheduling problems.

• Journal of Labour Economics
• /
• v.24 no.1
• /
• pp.149-176
• /
• 2001

This paper analyzes job sequences of men and women using optimal matching in order to find patterns of intra-generational mobility in Korean society. Men and women differ in their job careers: men show long-lasting job sequences with few gaps, while women either have short careers or have interrupted careers with long gaps. Long gaps in men's career are limited to those cases in which men move from agricultural to other job. The results from a combination of optimal matching and cluster analysis show that men's job sequences cluster around major occupations while women's cluster in terms of sequence length. The interrupted careers characteristic of women are considered to be consequent on the burdens of house keeping and child raising together with the discrimination against women pursuing careers.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1990.04a
• /
• pp.220-221
• /
• 1990

The objective of this study is to determine a near-optimal time schedule for processing necessary jobs in order to minimize total elapsed time. The fundamental assumptions are that jobs to be processed are classified into several groups and jobs within the same group are processed in succession in the flow-type GT line. A heuristic method by V. A. Petrov is applied to determine the job sequencing. In consideration of production quantity, group sequences and job sequences for each group are determined and the start time of processing for each job is calculated by computer.

• Korean Journal of Social Welfare
• /
• v.60 no.4
• /
• pp.55-77
• /
• 2008

After the economic crisis of Korea, the character of Korean Poverty has changed. Most notably, many people are working but poor. Therefore it is important to understand the characteristics of the working poor, especially the unstable work experiences of the working poor since one of the causes of poverty is that. Prior research about the working poor has not fully proven this issue. This study is to examine the job sequences of the working poor. Thus I utilized the KLIPS(Korea Labor and Income Study), and analyzed it by event sequence analysis and optimal matching methods. The job sequences are divided as follows: total years of working in the labor market, the number of gaps and the length of gaps in their careers, and the characteristics of experienced jobs since they have entered the labor market from age 15. As a result, there are no statistically significant in the total years of working in the labor market. And the number of gaps and the length of gaps in their careers, and the characteristics of experienced jobs show that working poor have been experiencing more unstable than non-poor. Thus, almost all of the male working poor has unstable jobs their whole lives, and the female working poor's job sequences show distinct features according to women's life course. These results can give political implications to the anti-poverty policy in Korea.

• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1528-1537
• /
• 2015

In this research, we show that constructing a specific job-processing-sequences like a OPL paragraph in OPM (we call it int a new terminology 'program', which just means plan) is essential step in programming, just like a blueprint for a wood furniture or a house. As a result of our research on how to produce a specific job-processing-sequences without OPM, we found that outlining tool is the most easy-to-use tool for the required job. We show that the MS-word outlining function can be used easily as a good programming supporting tool with Visual Studio C/C++.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.90-93
• /
• 2000

This paper presents job scheduling for non-identical parallel machines using Simulated Annealing (SA). The scheduling problem accounts for allotting work parts of L lots into M parallel machines, where each lot is composed of N homogeneous jobs. Some lots may have different jobs while every job within each lot has common due date. Each machine has its own performance and set up time according to the features of the machine, and also by job types. A meta-heuristic, SA, is applied in this study to determine the job sequences of the scheduling problem so as to minimize total tardiness of due. The SA method is compared with a conventional steepest descent(SD) algorithm that is a typical tool for finding local optimum. The comparison shows the SA is much better than the SD in terms tardiness while SA takes longer , but acceptable time.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.05a
• /
• pp.429-434
• /
• 2002

For companies assembling end products from sub assemblies or components, MRP (Material Requirement Planning) logic is frequently used to synchronize and pace the production activities for the required parts. However, in MRP, the planning of operational-level activities is left to short term scheduling. So, we need a good scheduling algorithm to generate feasible schedules taking into account shop floor characteristics and multi-level job structures used in MRP. In this paper, we present a GA (Genetic Algorithm) solution for this complex scheduling problem based on a new gene to reflect the machine assignment, operation sequences and the levels of the operations relative to final operation. The relative operation level is the control parameter that paces the completion timing of the components belonging to the same branch in the multi-level job hierarchy. In order to revise the fixed relative level which solutions are confined to, we apply large step transition in the first step and GA in the second step. We compare the genetic algorithm and 2-phase optimization with several dispatching rules in terms of tardiness for about forty modified standard job-shop problem instances.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.55-65
• /
• 2005

In recent manufacturing systems, most jobs may have several process plans, such as alternative sequence of operations, alternative machine etc. A few researches have addressed the necessity for the integration of process planning and scheduling function for efficient use of manufacturing resources. But the integration problem is very difficult and complex. Many prior researches considered them separately or sequentially. It introduces overlapping or partial duplications in solution efforts. In this paper, Integration problem of jobs with multiple process plans in a job shop environment Is addressed. In order to achieve an efficient integration between process planning and scheduling by taking advantage of the flexibility that alternative process plans offer, we designed GA(Genetic Algorithm)-based scheduling method. The performance of proposed GA is evaluated through comparing integrated scheduling with separated scheduling in real world company with alternative machines and sequences of operations. Also, a couple of benchmark problems are used to evaluate performance. The integrated scheduling method in this research can be effectively epplied to the real case.

• Journal of Information Technology Services
• /
• v.17 no.4
• /
• pp.37-52
• /
• 2018

With the increasing severity of the shortage of highly-skilled IT personnel, more and more attention is being paid to the professional career path and systematic career management of IT employees. Although some studies have been conducted to describe the current status of IT personnel, limited attempts have been made to analyze the career paths or career patterns of IT professionals from a longitudinal perspective. In this context, this study explored the job career patterns of IT professionals in Korea and examined their relationship with subjective and objective career success. To identify job career patterns over time, detailed information about jobs and positions were used and an optimal matching analysis (OMA) was conducted to calculate the dissimilarity matrix between employees' career sequences, while a cluster analysis was used to categorize the meaningful groups based on this dissimilarity data. This analysis revealed that career patterns among Korean IT personnel are more varied than previously thought. These career types have a significant relationship with individual profiles, such as age, education, industry and company size, and account for significant variations in the three main career success variables, i.e. quality of life, assessment of software quality, and wage level. It is expected that the findings of this study will contribute to refining the Korean career path so as to retain IT personnel, and raise the need to improve the low quality of life and poor SW work environment of IT personnel.