• Title/Summary/Keyword: Job-Shop

Search Result 273, Processing Time 0.031 seconds

Study on the Work Stress, Burnout and Compassion Satisfaction of the Estheticians (피부미용사의 직무스트레스와 소진 및 공감만족에 관한 연구)

  • Kim, Na-Young;An, Mi-Ryung
    • Journal of Convergence for Information Technology
    • /
    • v.9 no.11
    • /
    • pp.247-253
    • /
    • 2019
  • The purpose of this study was to identify the effects of work stress, burnout and compassion satisfaction of the estheticians. The sample consisted of 268 estheticians from esthetic-shop located in Seoul and Gyung-gi province. The questionnaire was organized into 4 items of general traits, 24 items of KOSS, and 10 items of burnout and compassion satisfaction from proQOL. Results show that estheticians experienced a greater than moderate degree of job stress, compassion satisfaction burnout, whereas differences existed according to general characteristics. but group was included in the top 75% of the factor on when compared to the Korean occupational stress scale. It is foreseeable that the burnout caused by the work of a estheticians is not small at all. This study is expected to be used as basic data in finding ways to reduce job stress and burnout of estheticians.

A Simulation Model for the performance of process using SIMAN Language in Flexible Manufacturing Systems (유연생산체제에서 SIMAN을 이용한 공정의 수행도 평가를 위한 시뮬레이션 모형)

  • 강영식;함효준
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.44
    • /
    • pp.153-161
    • /
    • 1997
  • This paper has proposed the modelling by simulation in order to evaluate the performance of process through discrete event simulation using SIMAN language in flexible manufacturing systems. The production system is assumed to be a job shop type of system under the batch production of discrete products. In this paper, the input data is the workstation(process) time, the number of workstation(process), a probability distribution, the number of simulation runs. Also, transient period is considered. In the case study, this paper deals with three products in real flexible manufacturing systems. Finally, a number of simulation runs were executed under different experimental conditions to obtain preliminary statistics on the following performance measures: operating rate of facility and average system operating rate, transient period, central processing unit, average system throughput, and average waiting time in queues.

  • PDF

Study Due-date Promising system using CTP Algorithm in SCM Environment (공급망상에서 CTP 알고리즘을 이용한 납기확약 시스템에 관한 연구)

  • 박상민;남호기;최진;이종천
    • Journal of the Korea Safety Management & Science
    • /
    • v.6 no.1
    • /
    • pp.97-108
    • /
    • 2004
  • This Study will introduce the concept of A TP(A vailable To Promise) and CTP(Capable to Promise) through the existing study, the process analysis of CTP, the modeling of algorithm and the embodiment of system. This research considers the environment of using Job-Shop method. The CTP algorithm models using LPST(Latest Possible Start Time) and EPST(Earliest Possible Start Time) method especially. It is important part of executing CTP systems. The CTP modeling and implementing develops to system which is capable to implement in the various business environment through additional and continuous research.

Genetic Algorithms for Tire Mixing Process Scheduling (타이어 정련 공정 스케줄링을 위한 유전자 알고리즘)

  • Ahn, Euikoog;Park, Sang Chul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.2
    • /
    • pp.129-137
    • /
    • 2013
  • This paper proposed the scheduling method for tire mixing processes using the genetic algorithm. The characteristics of tire mixing process have the manufacturing routing, operation machine and operation time by compound types. Therefore, the production scheduling has to consider characteristics of the tire mixing process. For the reflection of the characteristics, we reviewed tire mixing processes. Also, this paper introduces the genetic algorithm using the crossover and elitist preserving selection strategy. Fitness is measured by the makespan. The proposed genetic algorithm has been implemented and tested with two examples. Experimental results showed that the proposed algorithm is superior to conventional heuristic algorithm.

Employees' shop-floor participation and incremental innovation in small business (중소기업의 기술혁신에 관한 연구 : 종업원의 현장참여를 중심으로)

  • 안관영
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.40
    • /
    • pp.119-136
    • /
    • 1996
  • With new competitive environments, innovation is more necessary to survive severe competitions than ever. However, most Small and Medium(SM) businesses are used to be short of professional staffs, money and equipments for performing various innovations(ie., technological or administrative innovation, product development or Process development, and radical or incremental innovation). Many students have suggested that incremental innovation is more adequate than radical innovation in SM business. The purpose of this paper is to find antecedent factors In promote employees' Incremental Innovation Activities(IIA), In analyse moderating effects of ability and attitudes, and to test the difference of IIA-level by ability(or attitudes) and 11 independent factors. Each IIA-level by 5 variables of 11 independent variables-job variety, importance, identity, communication, performance dependency-is found to be significantly different in high-ability group affirmative-attitude group.

  • PDF

SPC chart for exponential weighted moving statistics in start-up process (초기공정에서 지수가중 이동 통계량을 이용한 SPC 관리도)

  • 이희춘;지선수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.41
    • /
    • pp.157-166
    • /
    • 1997
  • Classical SPC charting methods such as (equation omitted), R, S charts assume high volume manufacturing processes where at least 25 or 30 calibrate samples of size 4 or 5 each can be gathered to estimate the process parameters before on-line charting actually begines. However, for many processes, especially in a job-shop setting, production runs are not necessarily long and charting technique are required that do not that depend upon knowing the process parameters in advance of the run. In this paper, using modifying statistics, we give a method for constructing control charts for the process mean when the measurements are from a normal distribution. In this case, consider that smaller weight being assigned to the older data as time process and properties and taking method of exponential smoothing constant$(\lambda)$ are suggested.

  • PDF

a linear system approach

  • 이태억
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.10a
    • /
    • pp.118-118
    • /
    • 1993
  • We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

  • PDF

Scheduling of Machining Shop Composed of Machining Center and Multiple Pallets (머시닝 센터와 다연 Pallet으로 구성된 기계 가공 공장의 일정계획)

  • Lee, Cheol-Soo;Bae, Sang-Yun
    • IE interfaces
    • /
    • v.7 no.2
    • /
    • pp.107-120
    • /
    • 1994
  • This study introduces a scheduling policy to achieve unmanned operations in machining shops representing the feature of both FMS and machining centers. The proposed policy considers the practical constraints in the machining shops such as lot sizes, multiple pallets, and jig/fixtures. In addition, rescheduling to cope with extraordinary events(eg., arrival of high-priority jobs and breakdown of machines) is included. Basically, the scheduling policy consists of four procedures; (1) selection of a job according to dispatching rule, (2) selection of a machine, (3) assignment of jobs to a multiple pallet for the unmanned operation during a certain shift, and (4) prevention of unexpected machine idle caused by constraints on jig/fixture.

  • PDF

The Effect of Estimated Control Limits

  • JaiWook Baik;TaiYon Won
    • Communications for Statistical Applications and Methods
    • /
    • v.5 no.3
    • /
    • pp.645-657
    • /
    • 1998
  • During the start-up of a process or in a job-shop environment conventional use of control charts may lead to erroneous results due to the limited number of subgroups used for the construction of control limits. This article considers the effect of using estimated control limits based on a limited number of subgroups. Especially we investigate the performance of $\overline{X}$ and R control charts when the data are independent, and X control chart when the data are serially correlated in terms of average run length(ARL) and standard deviation run length(SDRL) using simulation. It is found that the ARL and SDRL get larger as the number of subgroups used for the construction of the chart becomes smaller.

  • PDF

A Note on the Minimization of the Expected Makespan and the Expected Flow Time in M Machine Flow Shops with Blocking

  • Wie Sung Hwan
    • Journal of the military operations research society of Korea
    • /
    • v.10 no.2
    • /
    • pp.75-83
    • /
    • 1984
  • Consider an m machine flow shop with blocking. The processing time of job j,j=1,..., n on each one of the m machines is equal to the same random variable $X_j$ and is distributed according to $F_i$. We assume that the processing times are stochastically ordered, i.e., $F_{1_{-st}}{<}F_{2_{st}}{<}cdots_{-st}{<}F_n$. We show that the sequence 1,3,5,...,n-1,n,n-2,...,6,4,2 when n is even and sequence 1,3,5,...,n-2,n,n-1 ... 6,4,2 when n is odd minimizes the expected makespan and that the sequence 1,...,n minimizes the expected flow time.

  • PDF