• 제목/요약/키워드: EXTENSIVE MANAGEMENT

검색결과 883건 처리시간 0.03초

최종사용자전산의 성공적 시행에 영향을 미치는 요인 연구 (An Empirical Analysis of Factors for a Successful Implementation of End User Computing)

  • 강신철
    • Asia pacific journal of information systems
    • /
    • 제3권1호
    • /
    • pp.54-87
    • /
    • 1993
  • This exploratory study addressed the issue of effective EUC management, based on the sociotechnical theory. Extensive literature review gave birth to a set of critical success factors in EUC. With those factors, a basic EUC model was developed. Then the model was tested in the domestic industry to find its validity. It was also attemped to develop a structural equation model in which critical factors for sucessful implementation of EUC are arranged by the result of empirical survey. In the final model, technical support, computer experience, user control, and top management support were included as exogenous factors. Thses contructs were found to influence directly or indirectly three endogenous factors, user satisfaction, computer use, and performance.

  • PDF

A Batch Arrival Queue with a Random Setup Time Under Bernoulli Vacation Schedule

  • Choudhury, Gautam;Tadj, Lotfi;Paul, Maduchanda
    • Management Science and Financial Engineering
    • /
    • 제15권2호
    • /
    • pp.1-21
    • /
    • 2009
  • We consider an $M^x/G/1$ queueing system with a random setup time under Bernoulli vacation schedule, where the service of the first unit at the completion of each busy period or a vacation period is preceded by a random setup time, on completion of which service starts. However, after each service completion, the server may take a vacation with probability p or remain in the system to provide next service, if any, with probability (1-p). This generalizes both the $M^x/G/1$ queueing system with a random setup time as well as the Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further, attempts have been made to unify the results of related batch arrival vacation models.

사회적 자본이 노사관계 및 기업성과에 미치는 영향에 관한 실증연구 (An Empirical Study of the Effects of Social Capital on Industrial Relations and Firm Performance)

  • 이영찬;김영재;이승석
    • 지식경영연구
    • /
    • 제10권4호
    • /
    • pp.133-150
    • /
    • 2009
  • The purpose of this study is to examine the effects of social capital on industrial relations and firm performance, and to find out social capital is the antecedent factor of industrial relations. To serve the purpose of this study, we conducted the extensive survey on department managers and labor delegates of 110 Korean manufacturing firms. From the result, we identified that the industrial relations are more cooperative as the level of social capital increases, and the firm which has good relations between labor and management shows high performance. In addition, two factors of social capital (Trust/Participation) directly affect to the firm performance.

  • PDF

자본시장의 위상전이행태에 관한 학제간 융합연구 : 사례연구 (An Interdisciplinary Case Study on the Phase-Shifting Behavior of Financial Markets)

  • 류두진;주강진;김현나;양희진
    • 경영과학
    • /
    • 제33권2호
    • /
    • pp.117-131
    • /
    • 2016
  • This study introduces the concepts on the phase-shifting phenomenon of financial markets, which was firstly used in econophysics area and explains how the phase-shifting behavior is studied in the fields of business management and finance. Specifically, we explain how the phases of financial markets are extremely changed under some external conditions, do an extensive literature review, and carry out case studies focusing on the 3 major financial crisis events including the 87 October crash, 97 Asian financial crisis, and 2007 global financial crisis. We also empirically examine the phase-shifting behavior of the Korean ELW products that has a similar payoff structure to the KOSPI200 options.

SI 프로젝트의 효율성 평가를 위해 자료포괄분석과 기계학습을 결합한 하이브리드 분석 (Hybrid approach combining Data Envelopment Analysis and Machine Learning to Evaluate the Efficiency of System Integration Projects)

  • 홍한국;김종원;서보라
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 2006년도 춘계 국제학술대회 논문집
    • /
    • pp.77-88
    • /
    • 2006
  • Data Envelopment Analysis (DEA), a non-parametric productivity analysis tool, has become an accepted approach for assessing efficiency in a wide range of fields. Despite of its extensive applications, some features of DEA remain bothersome. DEA offers no guidelines to where relatively inefficient DMU(Decision Making Unit) improve since a reference set of an inefficient DMU consists of several efficient DMUs and it doesn't provide a stepwise path for improving the efficiency of each inefficient DMU considering the difference of efficiency. We aim to show that DEA can be used to evaluate the efficiency of System Integration Projects and suggest the methodology which overcomes the limitation of DEA through hybrid analysis utilizing DEA along with machine learning.

  • PDF

주문 집약을 위한 재고 변용 모델 연구 : 제철산업의 소로트 주문 집약 활용을 중심으로 (A Simulation Study on a Variant Policy of Inventory Replenishment for the Order Consolidation : A Case of Steel Industry)

  • 정재헌
    • 한국경영과학회지
    • /
    • 제31권2호
    • /
    • pp.99-112
    • /
    • 2006
  • In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase amount constraint. And also, if we order at a certain date which was set by administrative convenience, we have capacity constraint to order the consolidated order demands (capacity constraint). We show this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invent a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

Comparison of (s, S) and (R, T) Policies in a Serial Supply Chain with Information Sharing

  • Kwak, Jin Kyung
    • Management Science and Financial Engineering
    • /
    • 제19권1호
    • /
    • pp.17-23
    • /
    • 2013
  • It has been studied that retailer's using a suboptimal (R, T) policy is often more desirable to make the best use of information flows than the locally optimal (s, S) policy in a two-stage serial supply chain. In this paper, by performing an extensive computational study, we tabulate the benefit of the retailer's using (R, T) policy instead of (s, S) policy in a supply chain with information sharing, and compare it to a maximum possible benefit that could be achieved in a centralized supply chain. We can understand the mechanisms of how the cost parameters and demand variance affect the benefit of the retailer's using (R, T) policy instead of (s, S) policy, by comparing decentralized and centralized systems.

정규분포를 따르는 다단계 시리얼 공급사슬에서의 재고 정책 (Inventory Policies for Multi-echelon Serial Supply Chains with Normally Distributed Demands)

  • 권익현;김성식
    • 대한안전경영과학회지
    • /
    • 제8권3호
    • /
    • pp.115-123
    • /
    • 2006
  • The main focus of this study is to investigate the performance of a clark-scarf type multi-echelon serial supply chain operating with a base-stock policy and to optimize the inventory levels in the supply chains so as to minimize the systemwide total inventory cost, comprising holding and backorder costs as all the nodes in the supply chain. The source of supply of raw materials to the most upstream node, namely supplier, is assumed to have an infinite raw material availability. Retailer faces random customer demand, which is assumed to be stationary and normally distributed. If the demand exceeds on-hand inventory, the excess demand is backlogged. Using the echelon stock and demand quantile concepts and an efficient simulation technique, we derive near optimal inventory policy. Additionally we discuss the derived results through the extensive experiments for different supply chain settings.

철도 사고/장애 위험요인 분석을 통한 위험목록(Hazard List)체계 수립에 관한 연구 (Development of Hazard List for Railway Accidents/Incidents through Identification of Risk Sources)

  • 박찬우;박주남;조연옥;왕종배
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2005년도 추계학술대회 논문집
    • /
    • pp.581-586
    • /
    • 2005
  • In this study, a hazard list is developed for accidents/incidents of Korean railway through identification of the risk sources. The risk sources are classified by the progress of the accidents/incidents, which consists of cause, triggering event, and failure of the safety system. The hazard list of railway accidents/incidents of Korea is then developed through extensive review of both domestic and foreign data for railway accidents/incidents risk sources. The list is refined for each of six subsystems of the railway system, which includes safety management system, operation management, human error and qualification management, installations and equipments, external hazard, and railway level crossing.

  • PDF

Rework가 존재하는 이종병렬기계에서의 일정계획 수립 (Scheduling Algorithm for Nonidentical Parallel Machines Problem with Rework)

  • 강용하;김성식;박종혁;신현준
    • 대한산업공학회지
    • /
    • 제33권3호
    • /
    • pp.329-338
    • /
    • 2007
  • This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.