• 사회복지연구
• /
• 제44권3호
• /
• pp.323-346
• /
• 2013

본 연구의 목적은 근로빈곤층이 경험한 빈곤이력에 따른 노동경력을 추적하여 총체적으로 파악하는데 있다. 이를 위해 한국노동패널 1-10차 년도의 결합자료를 이용하여 사건배열분석을 실시하였다. 분석의 결과, 일시빈곤층은 상대적으로 안정적인 노동경력을 공유하는데 반해, 반복빈곤층과 지속빈곤층은 불안정 저소득 저숙련의 일자리를 순환하는 특성을 보이며, 고용과 빈곤 간 상호연관성 기제가 약화되어 있다. 또한 근로빈곤층의 노동경력은 주로 상용직을 경험하는 유형, 임시 일용직을 경험하는 유형, 자영업을 지속하는 유형, 일자리 전환이 활발하다 상용직을 경험하는 유형과 자영업을 경험하는 유형 등의 5개 유형으로 구분된다. 빈곤이력에 따른 노동경력 유형의 상이한 경로가 관찰되며, 하위집단별 차별화된 정책적 개입이 요구된다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• 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.

• 노동경제논집
• /
• 제24권1호
• /
• pp.149-176
• /
• 2001

본 논문에서는 한국 사회에서 세대내 직업경력의 유형을 찾고자 최적일치법을 이용하여 남성과 여성의 직업경력 분석하였다. 남성과 여성은 직업경력에서 상당한 차이를 보이며 남성의 경우 공백이 거의 없이 직업경력이 이어지는 반면, 여성은 직업경력이 일찍 종결되거나 상당한 공백을 두고 경력이 단절되는 경향을 보인다. 남성의 경우 경력의 공백이 생기는 경우는 농업직으로부터 기타 직업으로의 이동에 국한된다. 최적일치법과 집락분석을 결합하여 남성과 여성의 직업경력을 유형화한 결과 남성은 직업별로 유형 구분이 잘 되어 나타나는 반면, 여성은 주로 경력의 지속기간에 의해 유형이 구분된다. 남성에 비해 여성은 직업경력이 단절되며, 이는 가사와 육아의 부담, 그리고 여성의 경력을 지속하는 데 대한 사회적 차별에 기인하는 것으로 추정된다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1990년도 춘계공동학술대회논문집; 한국과학기술원; 28 Apr. 1990
• /
• 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.

• 한국사회복지학
• /
• 제60권4호
• /
• pp.55-77
• /
• 2008

본 연구는 근로빈곤층이 빈곤한 주요 원인이 이들이 노동시장에서 겪는 불안정한 경험이라는 점에 주목하여, 이들의 직업력이 어떻게 나타나는지 분석하였다. 이를 위해 사건배열분석과 최적일치법을 활용하여, 근로빈곤층의 직업력을 노동시장 진입 후 일한 기간, 직업 경력에서의 공백의 수와 그 기간, 거쳐 온 직업의 특성을 통해 총체적으로 이해하고자 하였다. 분석결과, 근로빈곤층은 비빈곤층과 비교할 때 일한 기간에서 통계적으로 유의미한 차이를 나타내지 않아 이들이 일을 적게 하기 때문에 빈곤한 것이 아니라는 것을 확인할 수 있었으며, 공백의 수와 기간, 직업의 특성을 통해 살펴본 결과 이들은 비빈곤층에 비해 불안정한 노동경험을 했다는 것을 확인할 수 있었다. 또한 남성과 여성 근로빈곤층 모두는 생애전반에 걸쳐 지속적으로 불안정한 노동경험을 했다는 것을 확인하였다. 이상의 결과를 바탕으로 근로빈곤층을 대상으로 하는 탈빈곤정책에 대해 제언하였다.

• 한국멀티미디어학회논문지
• /
• 제18권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++.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• 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.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2002년도 춘계학술대회 논문집
• /
• 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.

• 한국경영과학회지
• /
• 제30권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.

• 한국IT서비스학회지
• /
• 제17권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.