• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.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.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• 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 프로세스를 실행시킬 수 있기 때문에 더욱 큰 시간 효율을 보여줄 수 있다.

• Management Science and Financial Engineering
• /
• v.9 no.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.

• Journal of Digital Contents Society
• /
• v.18 no.7
• /
• pp.1411-1418
• /
• 2017

The batch job scheduler recognizes the computational resources configured in the cluster environment and plays a role of efficiently arranging the jobs in order. In order to efficiently use the limited available resources in the cluster, it is important to analyze and characterize the characteristics of user tasks. To do this, it is important to identify various scheduling algorithms and apply them to the system environment. Most scheduler software reflects the user's work environment, from job submission to termination, as well as the state of the inventory and system status of the entire managed object. It also stores various information related to task execution, such as job scripts, environment variables, libraries, wait for tasks, start and end times. In this paper, we analyze the execution log of the scheduler such as user 's success rate, execution time, and resource size through information related to job execution through batch scheduler. Based on this, it can be used as a basis to optimize the system by increasing the utilization rate of resources.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.615-619
• /
• 2004

This paper considers a variation of customer order scheduling problems. The variation is the case where machine-job assignment is fixed, and the objective is to minimize the sum of the completion times of the batches. In customer order scheduling problems, jobs are dispatched in batches. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. We first establish a couple of lower bounds. Then, we develop a dynamic programming (DP) algorithm that runs in exponential time on the number of batches when there exist two machines. For the same problem with arbitrary number of machines, we present two simple heuristics, which use simple scheduling rules such as shortest batch first and shortest makespan batch first rules. Finally, we empirically evaluate the heuristics.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.92-96
• /
• 2005

This paper deals with a batch processor model in which the batch processing times depend on the jobs assigned to the batch. Each job has a distinct processing time which is determined as not the exact value but the range from the lower limit to the upper, which makes it possible to group several jobs into the same batch. In point of this flexibility our model can be referred to as the generalization of the bum-in model in which the upper limit of each job is unbounded. The jobs to be scheduled may be available nonsimultaneously. Therefore they have different ready times. We develop the model to describe the problem situation and the heuristic methods to minimize the total tardiness. And our batching rule is compared with other dispatching ones.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.2
• /
• pp.133-140
• /
• 2018

In this paper, we develop an automated software for in-plane structural analysis of composite laminated structures. The developed software supports various failure criteria and reports the analysis results considering user's convenience. It also provides batch job analysis function based on parallel processing technique. To verify the performance of the software, we compared margin of safety(MS) calculated in the software to those obtained from in-house method and the specimen experiment. As a result of comparisons, there was an error of less than 0.01 in the in-house method and it is within about ${\pm}10%$ with the specimen experiment. In addition, we confirmed the improvement of execution speed of batch job analysis based on parallel processing technique.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.691-697
• /
• 2015

Supercomputers are used for many different areas including new product design of industries as well as state-of-the-art science and technology for large amount of computational needs. Tachyon is a 4th supercomputer built at KISTI that is a high-performance parallel computing system with 3,200 computing nodes and infrastructures. This system is currently about 10,000 users and over 170 organizations are used, the number of jobs they are performing work in batch type form through a scheduler. Also, this system logs lots of job scripts, execution environment, library, job status from the job submit to end. In this paper, we analyzed batch jobs information from Sun Grid Engine, that use as a scheduler in Tachyon system, and job executed information in Tachyon System. In particular, we distinguished the fail jobs from the all tasks that users perform and we analyzed the cause of failure. Among them, we can extracted some of jobs that can be regarded as normal jobs through the improvement in those works logged as all of fail jobs.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.420-420
• /
• 1999