• Title/Summary/Keyword: New Jobs

Search Result 465, Processing Time 0.027 seconds

A Study on Determining Single-Center Scheduling for LTV(LifeTime Value) Using Heuristic Method (휴리스틱 방법을 활용한 고객 생애 가치에 대한 단일 업체 일정계획 수립에 관한 연구)

  • 양광모;강경식
    • Journal of the Korea Safety Management & Science
    • /
    • v.5 no.1
    • /
    • pp.83-92
    • /
    • 2003
  • Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

A parallel tasks Scheduling heuristic in the Cloud with multiple attributes

  • Wang, Qin;Hou, Rongtao;Hao, Yongsheng;Wang, Yin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.287-307
    • /
    • 2018
  • There are two targets to schedule parallel jobs in the Cloud: (1) scheduling the jobs as many as possible, and (2) reducing the average execution time of the jobs. Most of previous work mainly focuses on the computing speed of resources without considering other attributes, such as bandwidth, memory and so on. Especially, past work does not consider the supply-demand condition from those attributes. Resources have different attributes, considering those attributes together makes the scheduling problem more difficult. This is the problem that we try to solve in this paper. First of all, we propose a new parallel job scheduling method based on a classification method of resources from different attributes, and then a scheduling method-CPLMT (Cloud parallel scheduling based on the lists of multiple attributes) is proposed for the parallel tasks. The classification method categories resources into different kinds according to the number of resources that satisfy the job from different attributes of the resource, such as the speed of the resource, memory and so on. Different kinds have different priorities in the scheduling. For the job that belongs to the same kinds, we propose CPLMT to schedule those jobs. Comparisons between our method, FIFO (First in first out), ASJS (Adaptive Scoring Job Scheduling), Fair and CMMS (Cloud-Minmin) are executed under different environments. The simulation results show that our proposed CPLMT not only reduces the number of unfinished jobs, but also reduces the average execution time.

The Cardinality Constrained Multi-Period Linear Programming Knapsack Problem (선수제약 다기간 선형계획 배낭문제)

  • Won, Joong-Yeon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.64-71
    • /
    • 2015
  • In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ${\cdots}$, m. The total production time for periods from 1 to i is given by $b_i$ for each i = 1, ${\cdots}$, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[$O(n^2logn)$, $O(mn^2)$] where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

Job Competency Development Policy in the Era of the 4th Industrial Revolution (4차 산업혁명시대의 직업능력개발정책 - 이행노동시장 모형을 중심으로 -)

  • Yoo, Kil-sang
    • Journal of Practical Engineering Education
    • /
    • v.9 no.2
    • /
    • pp.167-174
    • /
    • 2017
  • The purpose of this paper is to review the effects of the $4^{th}$ Industrial Revolution on job competency development by the Transitional Labor Market(TLM) model, and suggest job competency development policiy in the rea of the $4^{th}$ Industrial Revolution. The $4^{th}$ Industrial Revolution will create new jobs, destroy many current jobs, and will fundamentally change employment pattern, contents of jobs and ways of works. In these circumstances, we will confront more risks in each stage of labor market transition. To minimize the risks of TLM, we should reform education and develop life time career and job competency. We have to train high level talented persons to lead the $4^{th}$ Industrial Revolution. We have to retrain employed people to adjust new technology and to enhance employability and adaptability. We have to train vulnerable groups so that they may adjust new circumstance. Government should develop life time job competency development open platform.

A critical study on the strategies of the employment policies for older people (고령자 고용정책의 대응전략에 대한 비판과 시민권(citizenship)의 원리를 통한 대한 모색)

  • Rhee, Ka-Oak;Lee, Ji-Young
    • 한국노년학
    • /
    • v.25 no.2
    • /
    • pp.171-193
    • /
    • 2005
  • Nowadays, the employment policies for older people is requested to become the new form in the change of information, globalization, and aging. It is discussed, simultaneously, about an age integrated society as the full time jobs' continuation and social jobs after the full time jobs. The discussion of jobs' continuation include from institutional system to age integrated society. Social jobs include from public labor to social wages. jobs' continuation passes over stabilization, regarding it as ideal society. social jobs are interpreted it as residual welfare, excluding the meaning of social solidarity. In fact, most of the debates is overwhelmed by the logic of economy. And so they pass over the quality of life of individuals. Therefore, this study critics the employment policies for older people in the present situation and states a direction improving the quality of life older people.

Is Job Search for the Employed More Effective than That for the Unemployed? (취업상태에서의 직장탐색이 보다 효과적이었을까?)

  • Nam, Kigon
    • Journal of Labour Economics
    • /
    • v.39 no.2
    • /
    • pp.53-81
    • /
    • 2016
  • This study analyzes the difference of search efforts and labor market performance between employed searchers and unemployed searchers, using GOMS(Graduates Occupational Mobility Survey) data collected by Korea Employment Information Service. The results show that unemployed searchers concentrated on the job search more actively, and their reservation wage decreased more rapidly than that of employed searchers. Therefore, considering only new jobs, the probability of employment was lower and the wage was higher for employed searchers than for unemployed searchers. However, both the employment probability and the wage were higher for the employed searchers, if analyzing all jobs including existing jobs of employed searchers. The results of this study imply that the employed search may be more effective strategy than the unemployed search.

  • PDF

No Tardiness Rescheduling with Order Disruptions

  • Yang, Jaehwan
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.1
    • /
    • pp.51-62
    • /
    • 2013
  • This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

A Two-Stage Scheduling Approach on Hybrid Flow Shop with Dedicated Machine (전용기계가 있는 혼합흐름공정의 생산 일정 계획 수립을 위한 2단계 접근법)

  • Kim, Sang-Rae;Kang, Jun-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.47 no.4
    • /
    • pp.823-835
    • /
    • 2019
  • Purpose: This study deals with a production planning and scheduling problem to minimize the total weighted tardiness on hybrid flow shop with sets of non-identical parallel machines on stages, where parallel machines in the set are dedicated to perform specific subsets of jobs and sequence-dependent setup times are also considered. Methods: A two-stage approach, that applies MILP model in the 1st stage and dispatching rules in the 2nd stage, is proposed in this paper. The MILP model is used to assign jobs to a specific machine in order to equalize the workload of the machines at each stage, while new dispatching rules are proposed and applied to sequence jobs in the queue at each stage. Results: The proposed two-stage approach was implemented by using a commercial MILP solver and a commercial simulation software and a case study was developed based on the spark plug manufacturing process, which is an automotive component, and verified using the company's actual production history. The computational experiment shows that it can reduce the tardiness when used in conjunction with the dispatching rule. Conclusion: This proposed two-stage approach can be used for HFS systems with dedicated machines, which can be evaluated in terms of tardiness and makespan. The method is expected to be used for the aggregated production planning or shop floor-level production scheduling.

Innovative value chain creation research according to AI jobs

  • SEO, Dae-Sung;SEO, Byeong-Min
    • The Journal of Industrial Distribution & Business
    • /
    • v.11 no.10
    • /
    • pp.7-16
    • /
    • 2020
  • Purpose: It suggests that making a policy and strategies in a way of AI and its impact of commercialization on economic efficiency, social custom ethics. Research design, data, and methodology: The paper has analyzed the data based on the proposed model when derived as AI vs. FI job, etc. It is very different for each professional evaluation, which is artificial intelligence or robot job. One concept case was selected as a substitute job, with a relatively low level of occupation ability, such as direct labors, easily replaced. By the induction data has resulted in modeling. Results: The paper suggests that AI at high level become something how to make real decisions on ethical value modeling. Through physical simulation with the deduction data, it can be tuned to design and control what has not been solved, from human senses to climate. Conclusion: For the exploiting of new AI decision-making jobs in markets, the deduction data is possible to prove to AI's Decision-making that the percentage who can easily have different leadership as is different for each person. what is generated by some information silos may be applied to occupation societies. The empirical results indicate the deduction data that if AI determines ethical decisions (VC) for that modifications, it may replace future jobs.

Developing a Best-Evidence Pre-employment Medical Examination: An Example from the Construction Industry

  • Gouttebarge, Vincent;van der Molen, Henk F.;Frings-Dresen, Monique H.W.;Sluiter, Judith K.
    • Safety and Health at Work
    • /
    • v.5 no.3
    • /
    • pp.165-167
    • /
    • 2014
  • The Dutch construction industry has introduced a compulsory preemployment medical examination (PE-ME). Best-evidence contents related to specific job demands are, however, lacking and need to be gathered. After the identification of job demands and health problems in the construction industry (systematic literature search and expert meeting), specific job demands and related requirements were defined and instruments proposed. Finally, a work ability assessment was linked to the instruments' outcomes, resulting in the modular character of the developed PE-ME. Twenty-two specific job demands for all Dutch construction jobs were identified, including kneeling/squatting, working under time pressure, and exposure to hazardous substances. The next step was proposing self-report questions, screening questionnaires, clinical tests, and/or performance-based tests, leading to a work ability judgment. "Lifting/carrying" is described as an example. The new modular PE-ME enables a job-specific assessment of work ability to be made for more than 100 jobs in the Dutch construction industry.