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

검색결과 290건 처리시간 0.024초

단위작업 편성 문제의 Worst Case 분석 (Worst Case Analysis of Tree Algorithm for Minimum Batch Cover Problem)

  • 장준호;장수영
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • pp.281-283
    • /
    • 2006
  • In this paper, we consider the problem of batch processing of orders, where either a single order or a pair of orders which satisfies specific conditions may be grouped in the same batch. The objective of the problem is to minimize the number of batches formed to accommodate all orders. We prose an approach based on a Known algorithm proven to be optimal for special class of problems with tree structure and show the approach to have the worst case ratio of $2-{\frac{2}{n}}$

  • PDF

여러 종류의 가공물과 배치 기계가 있는 재진입 흐름생산의 평균치분석 (Mean value analysis of re-entrant lines with batch machines processing multiclass jobs)

  • 박영신;전지혁;김수영
    • 한국경영과학회지
    • /
    • 제25권1호
    • /
    • pp.37-50
    • /
    • 2000
  • We are concerned with estimating the average performance of a re-entrant line with single-job machines and batch machines. The system has multiclass jobs, which will be processed in predetermined routes. An analytical approach may be intractable since the system would not be modeled by product form queueing networks due to the inclusion of batch machines and the consideraton of multiclass jobs which have different processing times. We propose an approximation method based on the Mean Value Analysis(MVA). Our method obtains the mean walting time in each buffer of a workstation and the mean cycle time using the MVA and heuristics. numerical experiments show that the errors of our method are within 5% compared with simulation.

  • PDF

센서 시스템의 매개변수 교정을 위한 데이터 기반 일괄 처리 방법 (Data-Driven Batch Processing for Parameter Calibration of a Sensor System)

  • 이규만
    • 센서학회지
    • /
    • 제32권6호
    • /
    • pp.475-480
    • /
    • 2023
  • When modeling a sensor system mathematically, we assume that the sensor noise is Gaussian and white to simplify the model. If this assumption fails, the performance of the sensor model-based controller or estimator degrades due to incorrect modeling. In practice, non-Gaussian or non-white noise sources often arise in many digital sensor systems. Additionally, the noise parameters of the sensor model are not known in advance without additional noise statistical information. Moreover, disturbances or high nonlinearities often cause unknown sensor modeling errors. To estimate the uncertain noise and model parameters of a sensor system, this paper proposes an iterative batch calibration method using data-driven machine learning. Our simulation results validate the calibration performance of the proposed approach.

병렬처리 기법을 이용한 복합재 적층 구조물의 면내 파손 해석 소프트웨어 개발 (Development of In-Plane Strength Analysis Software for Composite Laminated Structure with Parallel Processing Technique)

  • 정예지;최수영;안현수;하석운;문용호
    • 한국항공우주학회지
    • /
    • 제46권2호
    • /
    • pp.133-140
    • /
    • 2018
  • 본 논문에서는 복합재 적층 구조물의 면내 구조 해석을 위한 자동화 소프트웨어를 개발한다. 개발된 소프트웨어는 다양한 파손 기준을 제공하며 사용자의 편리성을 고려하여 해석 결과를 출력한다. 또한 병렬처리 기법에 기반한 일괄 처리 해석(batch job analysis) 기능을 지원한다. 구현된 소프트웨어의 성능을 검증하기 위하여 소프트웨어에서 계산된 안전 여유와 자체적으로 사용 중인 in-house 방식과 실제 시편 실험에서 얻어진 안전 여유간의 비교를 수행하였다. 비교 결과 in-house 방식과는 0.01 이하의 오차가 있었으며 시편 실험과는 약 ${\pm}10%$ 이내의 오차가 존재함을 확인하였다. 또한 병렬처리 기법을 적용한 일괄 처리 해석 작업의 실행 속도 개선을 확인하였다.

J-JDBS: Jini를 이용한 자바 분산 일괄처리 시스템 (J-JDBS: Java Distributed Batch-processing System Using Jini)

  • 구건;김정선
    • 전자공학회논문지CI
    • /
    • 제39권1호
    • /
    • pp.1-13
    • /
    • 2002
  • 분산 일괄처리 시스템은 네트워크 상에 있는 유휴상태의 컴퓨터를 활용하여 각 컴퓨터에 의하여 제출된 CPU-intensive한 작업을 수행시킴으로써 컴퓨터 자원의 활용도 및 작업의 생산성을 높일 수 있도록 하는 시스템이다. 이러한 시스템이 효과적으로 운용되기 위해서는 규모확장성, 결함 허용성, 그리고 머신 풀(pool) 구성의 유연성 등이 보장되는 것이 바람직하다. 그러나, 네트워크의 결함이나 컴퓨터의 다운 또는 컴퓨터 소유자의 자율적 의지에 의한 풀에서의 탈퇴 등으로 인하여 사용 가능한 컴퓨터가 비결정적(non-deterministic)일 수밖에 없는 동적 환경 하에서 그와 같은 특성을 보장하기는 매우 어렵다. 본 논문에서는 Jini의 core 서비스를 이용한 분산 일괄처리 시스템인 J-JDBS (Jini-based Java Distributed Batch-processing System) 시스템의 설계 및 구현을 제시함으로써, Discovery 서비스, Lookup 서비스, Lease 서비스 등의 Jini 코아 서비스가 규모확장성, 결함 허용성, 풀 구성의 유연성을 보장하는 신뢰성 있는 분산 일괄처리 시스템을 쉽고 빠르게 구축하는 데 매우 유용하게 적용될 수 있음을 보인다.

실시간 데이터 예측을 위한 인공지능 분석 방법 연구 (A Study on the Analysis Method of Artificial Intelligence for Real-Time Data Prediction.)

  • 홍필두
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2021년도 춘계학술대회
    • /
    • pp.547-549
    • /
    • 2021
  • 인공지능 분석에서 모델을 만들고 이를 검증하는 과정은 이미 생성된 데이터를 가지고 수행하는 Batch Processing이기에 연산 처리시간이 필요한 작업이다. 우리는 주식이나 국방 정보와 같은 실시간으로 발생하는 데이터를 바로 앞에서 발생한 데이터를 가지고 실시간으로 모델을 세우고 검증하여 예측하는 것이 필요하다. 이를 위한 해결책으로, 인공지능 모델링 작업에 필요한 데이터를 시간 처리 순으로 분할하고 데이터를 여러 프로세스에서 분산 처리하는 기법을 적용하여 해결하였다.

  • PDF

중간저장조의 저장시간과 저장제품의 제약을 고려한 다품종 회분공정의 조업완료시간 알고리듬 (Completion Time Algorithm in Multiproduct Batch Processes with Storage Time and Product Allocation Restriction in Intermediate Storage Tank)

  • 하진국;이경법;이인범;이의수
    • 제어로봇시스템학회논문지
    • /
    • 제9권9호
    • /
    • pp.727-735
    • /
    • 2003
  • The determination of completion time constitutes an important step in developing algorithms for short-term production scheduling. Existing completion time algorithms of multi-product batch processes often assume that intermediate storage tanks are always available when it is needed. In this paper, we consider a serial multi-product batch plants with ZW and NIS policy intermediate storge tank. We limit storage residence time and allocated products in the intermediate storage tank to minimize the quality change of the stored material as well as to reduce the clearing time during product change. A set of recurrence relations is suggested to calculate the completion times for the given batch sequence of products on all processing units. Also analytic solution for the suggested model is solved by a graphical method. The effectiveness of these results is proved by a few illustrative examples.

Customer Order Scheduling Problems on Parallel Machines with Job Capacity Restriction

  • Yang, Jaehwan
    • Management Science and Financial Engineering
    • /
    • 제9권2호
    • /
    • pp.47-68
    • /
    • 2003
  • We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

작업완료시각 추정을 활용한 배치 스케줄링 및 사례 연구 (Batch Scheduling Algorithm with Approximation of Job Completion Times and Case Studies)

  • 김송은;박성현;김수민;박경수;황민형;성종은
    • 산업경영시스템학회지
    • /
    • 제43권4호
    • /
    • pp.23-32
    • /
    • 2020
  • Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

연속회분식 반응기를 이용한 수산물 가공폐수 처리 (Treatment of Fish Processing Wastewater Using Sequencing Batch Reactor (SBR))

  • 백병천;신항식
    • 상하수도학회지
    • /
    • 제8권1호
    • /
    • pp.18-26
    • /
    • 1994
  • This research investigated efficient operation mode for the successful performance of SBR(sequencing batch reactor) treating fish processing wastewater, and the effect of sodium chloride (NaCl) on treatment efficiency. 2-hour-annerobic, 6-hour-aerobic and 3-hour-anoxic operation during reaction period was found an effective operating method for organic and nitrogen removal from fish processing wastewater in SBR system. The average removal efficiencies of COD, BOD, and total nitrogen in SBR operated continuousely were 91%, 95%, and 67.1%, respectively. The estimated values of biomass yield coefficient(Y), microbial decay coefficient($K_d$), and bioreaction rate constant(K) were $0.35gMLSS/gCOD_{removed}$, $0.015day^{-1}$, and $0.209hr^{-1}$, respectively. As NaCl concentration increased from 5 to 30g/L, sludge settleability was cnhanced but organic removal in the reactor was decreased. NaCl of influent had considerable relationship with COD removal, whereas it did not significant affect nitrogen removal.

  • PDF