• 대한안전경영과학회지
• /
• 제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.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.69-83
• /
• 2001

The problem of minimizing total tardiness on a batch processing machine with incompatible job families when there are sequence independent setup times between families is studied where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. A batch processing machine can process a number of jobs, within a maximal batch size, simultaneously as a batch. The processing time required of each batch is equal to the one of jobs. A dynamic programming algorithm which gives the optimal solution, and several heuristics are presented. Performance of simple dispatching rules based on due dates are compared, and the best of them is used as an initial solution for the decomposition algorithm, which is shown to give good schedules in relatively short computational time.

• 대한산업공학회지
• /
• 제40권2호
• /
• pp.215-222
• /
• 2014

This paper provides a real-time loading strategy for batch processing machines in which a number of jobs are simultaneously processed as a batch. The batch processing machines can be seen in both manufacturing industries (e.g., semiconductor, automobile and metal working) and service industries (transportation vehicles, mail shipment and theme park). This paper focuses on batch processing machines in semiconductor manufacturing. We present a look-ahead loading strategy for tardiness minimization where future arrivals and due dates are taken into consideration. Simulation tests are performed on the presented strategy and some existing loading heuristics under various production settings with different traffic intensities and forecasting errors. Experimental results show that our strategy provides the performance of good quality.

• Journal of Information Processing Systems
• /
• 제7권2호
• /
• pp.299-320
• /
• 2011

The overhead of processing fine-grain tasks on a grid induces the need for batch processing or task group deployment in order to minimise overall application turnaround time. When deciding the granularity of a batch, the processing requirements of each task should be considered as well as the utilisation constraints of the interconnecting network and the designated resources. However, the dynamic nature of a grid requires the batch size to be adaptable to the latest grid status. In this paper, we describe the policies and the specific techniques involved in the batch resizing process. We explain the nuts and bolts of these techniques in order to maximise the resulting benefits of batch processing. We conduct experiments to determine the nature of the policies and techniques in response to a real grid environment. The techniques are further investigated to highlight the important parameters for obtaining the appropriate task granularity for a grid resource.

• 산업경영시스템학회지
• /
• 제27권1호
• /
• pp.47-50
• /
• 2004

This paper deals with the problem of batching and scheduling of jobs whose processing times are different respectively But, they are given as not the exact value but the range from the lower limits to the upper, which makes it possible to group jobs into batches. The grouping of jobs is desirable because of the capability of the batch processor to accommodate several jobs at once. The time required to process the jobs in any batch depends on their lower limit processing times. Once processing is initiated on a batch processor, the batch cannot be interrupted, nor can other jobs be started. And all jobs are assumed to be simultaneously available. This paper develops the model to describe these situation and a heuristic method to minimize its total tardiness.

• 산업경영시스템학회지
• /
• 제31권4호
• /
• pp.21-28
• /
• 2008

본 연구는 반도체 제조공정에서 사용되는 단일 Burn-In oven에서의 Total weighted earliness와 Tardiness를 최소화하기 위한 생산 스케줄링을 결정하는 문제를 다룬다. 본 연구에서는 모든 작업은 상시에 시작가능하고 각각은 서로 다른 가중치를 가지고 있다고 가정하였다. 일반적으로 단일 Burn-In oven은 다양한 작업들이 동시에 가능한 Batch processing 기계이다. 따라서 다양한 작업들로 구성된 하나의 Batch의 Processing time은 그 Batch 내에 있는 가장 긴 Processing time을 가지는 작업에 의해 결정된다. 본 연구에서 Batch size는 미리 결정되지 않은 상황이라고 가정한 후, 최적의 Batch 개수와 작업의 순서를 결정하기 위해 유전자 알고리즘을 적용하였다. 수리적 예제를 통해서 다양한 접근방법의 성능들을 비교한 결과, 유전자 알고리즘이 Total weighted earliness와 Tardiness를 최소화하는데 가장 뛰어난 성능을 가지고 있음을 알 수 있다.

• Archives of Metallurgy and Materials
• /
• 제63권3호
• /
• pp.1443-1447
• /
• 2018

In this study, Ni(OH)₂ was synthesized by the continuous reaction by the Taylor fluid flow and compared with those prepared from the conventional batch type reaction. The nickel powders were synthesized by reduction of Ni(OH)₂ in an aqueous solution with hydrazine hydrate acting as the reductant. And then the characteristics of the nickel powder according to the synthesis method were compared. The average particle size of the synthesized Ni(OH)₂ using Taylor reactor was generally decreased about 1.5~2.5 times more than the batch reaction. The nickel powders prepared by the batch reaction highly agglomerated with non-uniform particles. In the Taylor reaction, the agglomeration of particles was broken and uniform nickel powder was produced.

• 대한산업공학회지
• /
• 제34권4호
• /
• pp.408-413
• /
• 2008

We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch within a fixed capacity. Our objective is to maximize the total number of batches filled up to the batch size. In this paper, we study the Level-2 problem where at most 2 kinds of orders can be grouped in a batch. This problem is known to be NP-hard and Max SNP-hard. So we develop heuristic algorithm and evaluate the performance of the algorithm.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 추계학술발표대회
• /
• pp.322-324
• /
• 2015

네트워크 시뮬레이터인 NS-2(Network Simulator 2)는 다양한 인터넷 프로토콜을 분석 할 수 있는 이산 사건 시뮬레이터로 데이터 처리량과 패킷 지연 및 전력 소모 등을 구할 수 있다. 그러나 NS-2를 사용하여 실험 시 네트워크 토폴로지의 설정이 변경 될 때마다 Tcl 스크립트를 통해 단일적으로 밖에 대응하지 못한다는 불편함이 존재한다. 이 문제를 해결하기 위해 본 논문에서는 멀티프로세싱 기법의 NS-2 Batch Job 시스템을 제안한다. 쉘(Bash) 스크립트로 NS-2 내부 구조의 간섭 없이 자동화 일괄 작업(Batch Job) 시스템을 모듈 구조로 구현 및 적용시켰다. 또한 실험의 시간 효율을 극대화시키기 위해 멀티프로세싱 기법을 이용하여, 하드웨어 성능의 부하가 걸리지 않는 선에서 NS-2 시뮬레이션을 다중 처리할 수 있도록 만들었다. 성능 비교분석 결과, 제안하는 Batch Job 시스템을 적용하면 기존에 NS-2를 이용한 실험에 걸리는 시간에 비해 소요시간이 평균 48% 감소한 결과를 볼 수 있다. 이는 하드웨어 성능이 향상된다면, 부하가 걸리지 않는 상한까지 더 많은 개수의 NS-2 프로세스를 실행시킬 수 있기 때문에 더욱 큰 시간 효율을 보여줄 수 있다.

• 제어로봇시스템학회논문지
• /
• 제18권4호
• /
• pp.384-390
• /
• 2012

In this paper, we analyzed the navigation error of TERCOM (TErrain COntour Matching), which is TRN (Terrain Referenced Navigation) batch processing, caused by scale factor error of radar altimeter and proved the possibility of false position fix when we use the TERCOM's feature matching algorithm. Based on these, we proposed the new TRN batch processing algorithm using the slope measurements of terrain. The proposed technique measures on periodic changes in the slope of the terrain elevation profile, and these measurements are used in the feature matching algorithm. By using the slope of terrain data, the impact of scale factor errors can be compensated. By simulation, we verified improved outcome using this approach compared to the result using the conventional method.