• 제목/요약/키워드: Management & operations step

검색결과 155건 처리시간 0.027초

OLAP를 이용한 설계변경 분석 방법에 관한 연구 (A Method for Engineering Change Analysis by Using OLAP)

  • 도남철
    • 한국CDE학회논문집
    • /
    • 제19권2호
    • /
    • pp.103-110
    • /
    • 2014
  • Engineering changes are indispensable engineering and management activities for manufactures to develop competitive products and to maintain consistency of its product data. Analysis of engineering changes provides a core functionality to support decision makings for engineering change management. This study aims to develop a method for analysis of engineering changes based on On-Line Analytical Processing (OLAP), a proven database analysis technology that has been applied to various business areas. This approach automates data processing for engineering change analysis from product databases that follow an international standard for product data management (PDM), and enables analysts to analyze various aspects of engineering changes with its OLAP operations. The study consists of modeling a standard PDM database and a multidimensional data model for engineering change analysis, implementing the standard and multidimensional models with PDM and data cube systems and applying the implemented data cube to core functions of engineering change management, the evaluation and propagation of engineering changes.

스마트워크 활용 수준에 따른 조직성과 강화에 관한 연구 (The Organization Performance Reinforcement by a Utilization Level of the Smart Work)

  • 정병호
    • 디지털산업정보학회논문지
    • /
    • 제14권4호
    • /
    • pp.189-204
    • /
    • 2018
  • The purpose of this study is to examine an organizational performance difference by individual utilization level of the smart work. The Smart work help minimizing business process and improving organization productivity based on information technology. This new technology provides a flexible way of the task through smart-work center, videoconferencing, telecommuting, mobile(remote control) and business-only messenger. This investment changes organizational culture, institutions and behavior by new technology applying. The organization system change due to smart work has trouble between alteration preferences and existing maintains a group. In response, the organization should make investment justification of smart work for institutional and culture stabilized by a new system in organization. I set up the analytical process of four stages for empirical research. It will analyze an operation difference of the smart work between pre and post investment in the first-step analysis. The two-step analysis will conduct a text mining analysis of smart work operations. The three-step analysis will identify organization performance differences among individual levels in smart work. The four-step analysis will identify a factor difference in organizational performance by individual utilization level on smart work. According to the study, It has been revealed a difference between the pre and post investment performance on smart work. The text mining analyses many appeared an improvement opinion of organizational culture. Next, there is a difference in organization performance among utilize groups of smart work. Furthermore, the factors of organizational performance among groups appeared differently. The theoretical contribution of this study provided to expand the organizational theory of organization change and resistance. The practical implications provided to require a strong guideline an organizational culture and institution for smart work.

CONVERGENCE OF DESCENT METHOD WITH NEW LINE SEARCH

  • SHI ZHEN-JUN;SHEN JIE
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.239-254
    • /
    • 2006
  • An efficient descent method for unconstrained optimization problems is line search method in which the step size is required to choose at each iteration after a descent direction is determined. There are many ways to choose the step sizes, such as the exact line search, Armijo line search, Goldstein line search, and Wolfe line search, etc. In this paper we propose a new inexact line search for a general descent method and establish some global convergence properties. This new line search has many advantages comparing with other similar inexact line searches. Moreover, we analyze the global convergence and local convergence rate of some special descent methods with the new line search. Preliminary numerical results show that the new line search is available and efficient in practical computation.

보육시설급식소의 HACCP시스템 적용을 위한 미생물적 품질평가 I. 가열조리 및 가열조리후 처리 공정을 중심으로 (Microbiological Quality Evaluation for Implementation of a HACCP System in Day-Care Center Foodservice Operations I. Focus on Heating Process and After-Heating Process)

  • 민지혜;이연경
    • Journal of Nutrition and Health
    • /
    • 제37권8호
    • /
    • pp.712-721
    • /
    • 2004
  • The objective of this study was to evaluate the microbiological quality of heating and after-heating processed foods for implementation of a HACCP system in day-care center foodservice operations. The evaluating points were microbial assessment and temperature of foods during receiving, cooking, and serving in heating process. In non-heating process, in addition to monitoring microbial assessment of food during preparation, cooking, and serving steps, the microbial populations of employees' hands and utensils and serving temperature were also evaluated. Microbiological quality was assessed using 3M Petrifilm$^{TM}$ to measure total plate count and coliforms for foods and utensils and Staphylococcus aureus for hands in five Gumi day-care centers. Microbiological quality assessment for foods and utensils is summarized as follows. Microbiological quality of the heating processed foods was satisfactory for cooking and serving steps. The internal temperature of food was above 74$^{\circ}C$. However, temperature control before the serving step was not achieved due to inappropriate time management between the cooking and serving steps. In the after-heating process, the total plate counts of boiled mungbean sprouts salad, blanched spinach salad, com vegetable salad were below the standard at the serving step. The majority of samples showed that coliforms exceeded the norm, which is thought to be the result of the cross-contamination from utensils. These results suggest that it is essential to educate employees on the importance of hand washing and of avoiding cross-contamination by using clean, sanitized equipment to serve food in the after-heating process. Establishing Sanitation Standard Operating Procedures (SSOPs) is an essential part of any HACCP system in day-care center foodservice operations.

GIS기반의 실시간 통합화물운송시스템 계획에 관한 연구 (A Study on a Real Time Freight Delivery Planning for Supply Center based on GIS)

  • 황흥석;김호균;조규성
    • 경영과학
    • /
    • 제19권2호
    • /
    • pp.75-89
    • /
    • 2002
  • According to the fast-paced environment of information technology and improving customer services, the design activities of logistics systems improve customer centric services and delivery performance implementing e-logistics system. The fundamental design issues that arise in the delivery system planning are optimizing the system with minimum cost and maximum throughput and service level. This study is concerned with the integrated model development of delivery system with customer responsive service level for DCM, Demand Chain Management. We used a two-step approach for this study. First, we formulated the supply. center facility planning using stochastic set-covering problem and assigned the customers to the supply center using clustering algorithm. Second, we developed vehicle delivery planning for a supply center based on GIS, GIS-VRP. Also we developed a GUI-type computer program for proposed method for supply center problem using GIS and Geo-DataBase of Busan area. The computational results showed that the proposed method was very effective on a set of test problems.

Implementing a Branch-and-bound Algorithm for Transductive Support Vector Machines

  • Park, Chan-Kyoo
    • Management Science and Financial Engineering
    • /
    • 제16권1호
    • /
    • pp.81-117
    • /
    • 2010
  • Semi-supervised learning incorporates unlabeled examples, whose labels are unknown, as well as labeled examples into learning process. Although transductive support vector machine (TSVM), one of semi-supervised learning models, was proposed about a decade ago, its application to large-scaled data has still been limited due to its high computational complexity. Our previous research addressed this limitation by introducing a branch-and-bound algorithm for finding an optimal solution to TSVM. In this paper, we propose three new techniques to enhance the performance of the branch-and-bound algorithm. The first one tightens min-cut bound, one of two bounding strategies. Another technique exploits a graph-based approximation to a support vector machine problem to avoid the most time-consuming step. The last one tries to fix the labels of unlabeled examples whose labels can be obviously predicted based on labeled examples. Experimental results are presented which demonstrate that the proposed techniques can reduce drastically the number of subproblems and eventually computational time.

A Decomposition Algorithm for a Local Access Telecommunication Network Design Problem

  • Cho, Geon
    • 한국경영과학회지
    • /
    • 제23권2호
    • /
    • pp.29-46
    • /
    • 1998
  • In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n$^2$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n=150 and H=1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

  • PDF

불충분 선호 정보하에서 처방적 그룹의사결정방법 지배 규칙에 관한 연구 (A Prescriptive Group Decision Making Method with Imprecise Preference Information)

  • 안병석
    • 한국경영과학회지
    • /
    • 제29권3호
    • /
    • pp.157-169
    • /
    • 2004
  • This paper presents a prescriptive approach to group decision making with group members' imprecise preference information. This includes an alternative method to Salo's inventive approach for identifying group's preferred alternative when attribute weights, consequences, and possibly group members' importance weights are specified in imprecise ways. The imprecise additive group value function can be decomposed into individual group member's imprecise decision making problems, which are finally aggregated to identify group's preferred alternative. The proposed approach is intuitive and easy to implement, and has merits in a couple of points. First. it is possible to view individual group member's inclinations toward conflicting alternatives and the degree of discrepancies to each other. Second, we can observe how much previous decision results of individual decision maker are influenced during interaction since decisions usually are not made at a single step especially in presence of partial preference information. Finally, the individual group member's decision results can be utilized for further investigation of dominance relations among alternatives in a case that interactive questions and responses fail to give a convergent group consensus.

정수선형계획법의 반도체 설계자동화에의 응용 (Application of integer linear programming on VLSI design automation)

  • 백영석;이현찬
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
    • /
    • pp.415-424
    • /
    • 1992
  • 본 논문에서는 정수선형계획법을 반도체 설계자동화과정에 이용한 예를 보인다. 반도체 설계자동화과정은 매우 여러 단계를 거치게 되는데, 본 논문에서는 상위수준 합성중 스케쥴링(scheduling)문제에 정수선형계획법을 응용하였다. 여기서 스케쥴링 문제는 설계자동화의 초기단계에서 알고리듬으로 주어진 입력을 하드웨어 요소들로 표현하는 과정에서 매 제어단계(control step)에서 수행하여야 할 연산내용을 결정하는 문제이다. 스케쥴링의 목적함수는 주어진 제어단계 갯수내에서 하드웨어 비용의 최소화이다. 이를 위해 우선 ASAP(As Soon As Possible)과 ALAP(As Late As Possible)방법을 이용하여 매 연산의 수행시작이 가능한 가장 빠른 시간과 가장 늦은 시간을 구한다. 이 두 시간 사이가 각 연산의 time frame이 되며 이를 이용하여 스케쥴링 문제를 정수 선형 계획법으로 공식화하여 풀었다. 이 공식화는 chaining, multicycle연산, pipeline data path, pipeline기능 유닛등에도 일반화하여 적용가능함을 보인다. 실험을 통해 본 공식화 방법이 기존 알고리듬에 의한 해보다 우수한 해를 제공함을 보인다. 비교를 위해 잘 알려진 benchmark회로인 bandpass filter를 이용하였는데 이 회로는 8개의 덧셈, 7개의 뺄셈 및 12개의 곱셈연산을 포함하고 있다. 제시된 알고리듬은 이 회로를 8개의 제어단계내에 총비용 675 (연산별 하드웨어 비용은 라이브러리로 주어짐)로 스케쥴링하였는데 이는 기존의 최상의 결과인 685보다 우수한 결과이다.

  • PDF

공변량을 이용한 Brown-Proschan 불완전수리 하의 시스템 신뢰도 추정 (Estimating System Reliability under Brown-Proschan Imperfect Repair with Covariates)

  • 임태진;이진승
    • 한국경영과학회지
    • /
    • 제23권4호
    • /
    • pp.111-130
    • /
    • 1998
  • We propose an imperfect repair model which depends on external effects quantified by covariates. The model is based on the Brown-Proschan imperfect repair model wherefrom the probability of perfect repair is represented by a function of covariates. We are motivated by deficiency of the BP model whose stationarity prevents us from predicting dynamically the time to next failure according to external condition. Five types of function for the probability of perfect repair are proposed. This article also presents a procedure for estimating the parameter of the function for the probability of perfect repair, as well as the inherent lifetime distribution of the system, based on consecutive inter-failure times and the covariates. The estimation procedure is based on the expectation-maximization principle which is suitable to incomplete data problems. focusing on the maximization step, we derive some theorems which guarantee the existence of the solution. A Monte Carlo study is also performed to illustrate the prediction power of the model as well as to show reasonable properties of the estimates. The model reduces significantly the mean square error of the in-sample prediction. so it can be utilized in real fields for evaluating and maintaining repairable systems.

  • PDF