• 제목/요약/키워드: Management processing

검색결과 5,955건 처리시간 0.033초

새로운 품질보증(品質保證)을 위한 자동검사(自動檢査)데이터의 활용(活用)에 관(關)한 연구(硏究) (A Study on the use of Automotive Testing Data for Updating Quality Assurance Models)

  • 조재입
    • 품질경영학회지
    • /
    • 제11권2호
    • /
    • pp.25-31
    • /
    • 1983
  • Often arrangement for effective product assessment and audit have not been completely satisfactory. The underlying reasons are: (a) The lack of early evidence of new unit quality. (b) The collection and processing of data. (c) Ineffective data analysis techniques. (d) The variability of information on which decision making is based. Because of the nature of the product the essential outputs from an affective QA organization would be: (a) Confirmation of new unit quality. (b) Detection of failures which are either epidemic or slowly degradatory. (c) Identification of failure cases. (d) Provision of management information at the right time to effect the necessary corrective action. The heart of an effective QA scheme is the acquisition and processing of data. With the advent of data processing for quality monitoring becomes feasible in an automotive testing environment. This paper shows how the method enables us to use Automotive Testing data for the cost benefits of QA management.

  • PDF

이기종 분산처리환경상에서 연결관리 객체의 정보공유 (A Sharing Scheme for Connection Mamagement Objects in Different Distributed Processing Environments)

  • 신영석;오현주
    • 한국통신학회논문지
    • /
    • 제22권4호
    • /
    • pp.793-803
    • /
    • 1997
  • Open networking architecture is required to support new multimedia services as integrated functions of network management and service architecture. In this paper, we propose the methodology of building block modeling using object grouping concepts and the sharing scheme of different distributed processing environments based on open networking architecture. The building block has the functions of object management, security object instance registry and object mapping in object group. It is necessary for the connection management information to be shared on the interworking between two domains. We implemented and validated connection management functions using computational object modeling and building block modeling in different distributed processing environments.

  • PDF

처리속도가 가변적인 작업들의 일괄처리 일정 계획 문제 (A Batch Processing Problem for Jobs with Variable Processing Sneed)

  • 오세호;이근부
    • 대한안전경영과학회지
    • /
    • 제8권4호
    • /
    • pp.195-204
    • /
    • 2006
  • This paper deals with a batch processor model in which the batch processing speed depends on the jobs assigned to the batch. Each job is completed by accomplishing its required job processing quantity which is calculated as job speed product processing time. Its speed is given as not the exact value but the range. Thus the batch sets are constructed by the jobs which hold the speed in common. And the batch sets are processed as soon as possible. We developed the model to described the problem situation and adopt the total tardiness as the decision criterion.

Minimizing total cost in proportionate flow shop with controllable processing times by polynomially solvable 0-1 unconstrained Quadratic Program

  • Choi, Byung-Cheon;Hong, Sung-Pil;Lee, Seung-Han
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2007년도 추계학술대회 및 정기총회
    • /
    • pp.309-312
    • /
    • 2007
  • We consider a proportionate flow shop problem with controllable processing times. The objective is to minimize the sum of total completion time and total compression cost, in which the cost function of compressing the processing times is non-decreasing concave. We show that the problem can be solved in polynomial time by reducing it to a polynomially solvable 0-1 unconstrained quadratic program.

  • PDF

Multi-objective Scheduling with Stochastic Processing Times

  • Jung, Young-Sik
    • 한국경영과학회지
    • /
    • 제20권1호
    • /
    • pp.179-193
    • /
    • 1995
  • A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.

  • PDF

RFID 시스템 도입을 위한 실시간 정보처리용 미들웨어의 개발에 관한 연구 (A Study on Development of Middleware for Real Time Data Processing with RFID)

  • 이광수;조용철;이창호
    • 대한안전경영과학회지
    • /
    • 제8권4호
    • /
    • pp.109-117
    • /
    • 2006
  • This paper deals with the middleware development for real time data processing using ubiquitous RFID(Radio Frequency Identification). This middleware system supports the real time data gathering, filtering, and collaborative operations within SCM. We expect to decrease the data processing cost and to upgrade the status of RTE(Real Time Enterprise) and competitive power of company.

유비쿼터스 지식관리를 위한 ECM 시스템 설계 (Design of an ECM System for Ubiquitous Knowledge Management)

  • 이준희
    • 한국콘텐츠학회논문지
    • /
    • 제5권5호
    • /
    • pp.10-16
    • /
    • 2005
  • 정보를 생산하고 공유, 관리하는 방법이 디지털 방식으로 변경되고, 각종 문서의 정보들이 전자화된 문서로 변환되면서 활용도가 크게 높아졌을 뿐만 아니라 그 양도 증가함으로써, 모든 형태의 디지털 콘텐츠에 대한 효율적인 관리시스템을 필요로 하게 되었다. 콘텐츠관리시스템은 일관된 콘텐츠 저장 방법 및 관리 정책의 부재로 종합적인 콘텐츠 관리 및 콘텐츠 처리 지연과 콘텐츠의 질적인 저하를 가져오는 문제점이 있다. 본 논문에서는 멀티미디어 데이터를 효율적으로 처리하고 유비쿼터스 지식관리를 위한 ECM(Efficient Contents Management) 시스템을 제안하였다.

  • PDF

HPC environment Design and Implementation for Efficient Job Processing in an NEC system

  • 최지우;박정옥;김현중;양종원;하경주;서창호
    • 컴퓨터교육학회논문지
    • /
    • 제13권4호
    • /
    • pp.69-75
    • /
    • 2010
  • As several users use a system simultaneously, a job management system is used to prevent exclusive uses in the system by a certain user and share entire resources for all users. The job management system is a type of scheduler that distributes limited resources for each job inquire efficiently. The system can be classified as different types and is to be properly selected according to the characteristics of systems and jobs. An NEC system is a job management system and usually applies NQS. The job management system has several queues, which are able to process jobs through distributed resources in which the efficiency of such job processing can be varied according to the composition of these queues. This study designs and configures differentiated queues according to service levels in order to improve the efficiency of the entire system as NQS is designed and that performs job processing. Also, this study analyze the performance of the job processing.

  • PDF

클라우드 환경에서 확장성을 지원하는 트랜잭션 처리 방법 (A Study for Transaction Processing Supporting Scalability in the Cloud)

  • 김치연
    • 한국전자통신학회논문지
    • /
    • 제7권4호
    • /
    • pp.873-879
    • /
    • 2012
  • 최근에 클라우드 컴퓨팅 패러다임은 다양한 응용에서 받아들여지고 있다. 클라우드 환경의 데이터 관리 시스템은 대용량의 데이터와 확장성을 지원하는 능력이 요구된다. 대용량의 데이터를 다루기 위해 일관성과 트랜잭션의 제약을 완화하는 것이 필요하고, 확장성을 지원하기 위해 구성 요소의 가감을 허용해야 한다. 이 논문에서는 클라우드 환경에서 트랜잭션을 처리할 때 필요한 시스템 모델과 확장가능한 모듈 관리 알고리즘에 대하여 제안한다. 시스템 모델은 트랜잭션 관리 모듈과 데이터 관리 모듈로 구성된다. 모듈 관리 알고리즘은 불필요한 재분배가 발생하지 않고, 기존 모듈의 부하를 덜어줄 수 있다. 성능 분석 결과, 모듈의 확장으로 응답 시간을 향상시키고 트랜잭션 철회율을 감소시킬 수 있음을 알 수 있었다.

시간제약이 있는 정보처리시스템의 성능분석 모형 (A Model for Performance Analysis of the Information Processing System with Time Constraint)

  • 허선;주국선;정석윤;윤주덕
    • 대한산업공학회지
    • /
    • 제36권2호
    • /
    • pp.138-145
    • /
    • 2010
  • In this paper, we consider the information processing system, which organizes the collected data to meaningful information when the number of data collected from multiple sources reaches to a predetermined number, and performs any action by processing the collected data, or transmits to other devices or systems. We derive an analytical model to calculate the time until it takes to process information after starting to collect data. Therefore, in order to complete the processing data within certain time constraints, we develop some design criteria to control various parameters of the information processing system. Also, we analyze the discrete time model for packet switching networks considering data with no particular arrival nor drop pattern. We analyze the relationship between the number of required packets and average information processing time through numerical examples. By this, we show that the proposed model is able to design the system to be suitable for user's requirements being complementary the quality of information and the information processing time in the system with time constraints.