• Journal of Information Processing Systems
• /
• 제14권3호
• /
• pp.621-630
• /
• 2018

Selection of a suitable task from the extensively available large set of tasks is an intricate job for the developers in crowdsourcing software development (CSD). Besides, it is also a tiring and a time-consuming job for the platform to evaluate thousands of tasks submitted by developers. Previous studies stated that managerial and technical aspects have prime importance in bringing success for software development projects, however, these two aspects can be more effective and conducive if combined with human aspects. The main purpose of this paper is to present a conceptual framework for task assignment model for future research on the basis of personality types, that will provide a basic structure for CSD workers to find suitable tasks and also a platform to assign the task directly. This will also match their personality and task. Because personality is an internal force which whittles the behavior of developers. Consequently, this research presented a Task Assignment Model (TAM) from a developers point of view, moreover, it will also provide an opportunity to the platform to assign a task to CSD workers according to their personality types directly.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.615-619
• /
• 2004

This paper considers a variation of customer order scheduling problems. The variation is the case where machine-job assignment is fixed, and the objective is to minimize the sum of the completion times of the batches. In customer order scheduling problems, jobs are dispatched in batches. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. We first establish a couple of lower bounds. Then, we develop a dynamic programming (DP) algorithm that runs in exponential time on the number of batches when there exist two machines. For the same problem with arbitrary number of machines, we present two simple heuristics, which use simple scheduling rules such as shortest batch first and shortest makespan batch first rules. Finally, we empirically evaluate the heuristics.

• 산업기술연구
• /
• 제29권B호
• /
• pp.25-31
• /
• 2009

The necessity of university's educational change is rising up, along with a social environment that keeps changing. This study deals with a newly educational style by recognizing the necessity of variance for engineering education, according to engineers' diversified roles within a company. The study was conducted by 7 members of middle-sized group, replaced from 5 members of small-sized and each was given his task by his job such as CEO, CMO, CSO, CIO, CCO, CQO or Auditor. On the basis of four theoretical backgrounds, this paper investigated students' level of learning satisfaction shown before and after task undertaking through a questionnaire and appraised the result made before and after task undertaking. This study is expected to improve a teaching method of university engineering education.

• 산업경영시스템학회지
• /
• 제44권4호
• /
• pp.43-52
• /
• 2021

In weapon assignment studies to defend against threats such as ballistic missiles and long range artillery, threat assessment was partially lacking in analysis of various threat attributes, and considering the threat characteristics of warheads, which are difficult to judge in the early flight stages, it is very important to apply more reliable optimal solutions than approximate solution using LP model, Meta heuristics Genetic Algorithm, Tabu search and Particle swarm optimization etc. Our studies suggest Generic Rule based threat evaluation and weapon assignment algorithm in the basis of various attributes of threats. First job of studies analyzes information on Various attributes such as the type of target, Flight trajectory and flight time, range and intercept altitude of the intercept system, etc. Second job of studies propose Rule based threat evaluation and weapon assignment algorithm were applied to obtain a more reliable solution by reflection the importance of the interception system. It analyzes ballistic missiles and long-range artillery was assigned to multiple intercept system by real time threat assessment reflecting various threat information. The results of this study are provided reliable solution for Weapon Assignment problem as well as considered to be applicable to establishing a missile and long range artillery defense system.

• International Journal of Advanced Culture Technology
• /
• 제10권3호
• /
• pp.18-24
• /
• 2022

This study attempts to provide basic data for the development of manpower maintenance programs by checking the degree of job stress and emotional burnout for nurses working in a university hospital and identifying factors affecting emotional burnout. Data were obtained through a structured questionnaire survey conducted on 187 nurses. The average score for job stress of nurses was 2.50 (range 1 to 4) and emotional burnout was 3.29 (range 1 to 5). The factors affecting emotional burnout were occupational climate, job demand, job insecurity, and lack of reward, which accounted for 44% of explanatory power. In order to reduce the emotional burnout of nurses, the management of medical institutions needs administrative and financial support. Further, it is necessary to improve the organizational culture regarding job assignment through job analysis, employment security, and a performance-based reward system.

• 산업경영시스템학회지
• /
• 제10권16호
• /
• pp.133-141
• /
• 1987

Man-machine assignment problem with random service and processing times is considered in this paper. Assuming heterogeneous semi-automatic machines, the problem is dealt with as follow; 1. For the different type of machines that have probabilistics distribution of processing time and nan service time, man·machine assignment problem is solved by heuristic method using expected time value if machine. 2. Since each related time is a random variable, the performance of the optimal assignment obtained from the above method is verified through monte carlo simulation method. 3. The above procedures are programed by BASIC language to use easily and rapidly in the personal computer. The result of this study can contribute to productivity enhancement by increasing the efficiencies of both operators and machines.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• 한국산업보건학회지
• /
• 제26권1호
• /
• pp.75-89
• /
• 2016

Objectives: The purpose of this study was to investigate job stress and satisfaction by general characteristics of engineers industrial hygiene management, and we expect to provide basic data for strategic plan to strengthen the role related to the job. Methods: The subjects of this study was 184 persons who belong to the Korean Industrial Health Association, and 178 completed questionnaires were analyzed. The survey was conducted from June 29 to July 3, 2015. Conclusions: It is necessary to decrease the stress caused by additional job through increasing manpower and developing detailed manual according to the position and systematic job assignment considering general characteristics. Also, it is judged that job satisfaction should increase by vitalizing mentoring, club, small group activity in workplace for maintaining and improving good personal relationship with team members, and implementing incentive system to acknowledge and reward personal duty result.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 춘계학술대회
• /
• pp.103-105
• /
• 2017

하둡 맵리듀스(MapReduce)는 사용자가 요청한 잡을 하둡 클러스터에서 효과적으로 병렬 분산 처리하기 위한 프레임워크이다. 맵리듀스의 태스크 스케쥴러는 사용자의 잡 태스크들을 여러 노드에 할당하기 위한 기법이다. 하지만, 기존의 스케쥴러는 노드의 가용 상태에 따라 규모가 동적으로 변화하는 하둡 클러스터를 고려하지 않음으로써 클러스터의 자원을 충분히 활용하지 못하는 문제가 있다. 본 논문에서는 노드의 가용성을 고려하여 잡 태스크를 효과적으로 할당함으로써 하둡 클러스터의 활용성을 높이는 태스크 할당 정책을 제시한다.

• 한국컴퓨터정보학회논문지
• /
• 제21권9호
• /
• pp.91-100
• /
• 2016

In this research, emergency vehicle dispatching problems faced with in the wake of massive natural disasters are considered. Here, the emergency vehicle dispatching problems can be regarded as a single machine stochastic scheduling problems, where the processing times are independently and identically distributed random variables, are considered. The objective of minimizing the expected number of tardy jobs, with distinct job due dates that are independently and arbitrarily distributed random variables, is dealt with. For these problems, optimal static-list policies can be found by solving corresponding assignment problems. However, for the special cases where due dates are exponentially distributed random variables, using a proposed dynamic programming approach is found to be relatively faster than solving the corresponding assignment problems. This so-called Pivot Dynamic Programming approach exploits necessary optimality conditions derived for ordering the jobs partially.