• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1826-1829
• /
• 2003

Fine chemical production must assure high-standard product quality as well as characterized as multi-product production in small volumes. Installing high-precision batch distillation is one of the common elements in the successful manufacturing of fine chemicals, and the importance of the process operation strategy with quality assurance cannot be overemphasized. In this study, we investigate the optimal operation strategy and production planning of a sequential multi-purpose plants consisting of batch processes and batch distillation with unlimited intermediate storage. We formulated this problem as an MILP model. A mixed-integer linear programming model is developed based on the time slot, which is used to determine the production sequence and the production path of each batch. Illustrative examples show the effectiveness of the approach.

• 대한산업공학회지
• /
• 제22권2호
• /
• pp.231-245
• /
• 1996

Semiconductor manufacturing line includes several batch processes which are to be controlled effectively to enhance the productivity of the line. The key problem in batch processes is a dynamic batch sizing problem which determines number of lots processed simultaneously in a single botch. The batch sizing problem in semiconductor manufacturing has to consider delay of lots, setup cost of the process, machine utilization and so on. However, an optimal solution cannot be attainable due to dynamic arrival pattern of lots, and difficulties in forecasting future arrival times of lots of the process. This paper proposes an efficient batch sizing heuristic, which considers delay cost, setup cost, and effect of the forecast errors in determining the botch size dynamically. Extensive numerical experiments through simulation are carried out to investigate the effectiveness of the proposed heuristic in four key performance criteria: average delay, variance of delay, overage lot size and total cost. The results show that the proposed heuristic works effectively and efficiently.

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

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

• 산업경영시스템학회지
• /
• 제34권4호
• /
• pp.1-10
• /
• 2011

This paper addresses the analysis of the travel distance and order picking time of the vehicle in a aisle when items are picked by the batch in a warehouse system. Batching is to combine several orders in a single tour of the storage/retrieval machine. An advantage of batching is that the length of a tour for a batch of orders is shorter than the sum of the individual orders' tour lengths. The average travel distance and order picking time when a batch is picked in a aisle of the warehouse systems are analyzed for the batch size. And when the vehicle is idle, the dwell point of the vehicle to minimize to the response distance is analyzed. As the batch size is increased, average order picking time per item is decreased. The problem is analyzed and a numerical example is showed to explain the problem.

• 한국지반공학회논문집
• /
• 제18권5호
• /
• pp.159-167
• /
• 2002

아연의 주물사에 대한 분배계수는 주물사에 포함된 TOC, 점토 함량, 총 철 함량 등에 따라 변하고 특히 용액 PH에 큰 영향을 받는 것을 관찰하였다. Batch 실험으로부터 얻어진 경험식으로부터분배계수와 제거상수를 예측할 수 있었다. Batch kinetic 실험과 batch sorption 실험으로부터 얻어진 분배계수는 용액 pH가 같을 시 거의 같은 값을 보이고 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.582-588
• /
• 1993

A scheme of dynamic optimization for batch reactor his been developed and applied to a semi-batch esterification reactor. To obtain optimal operating conditions for the given semi-batch reactor system with complex reaction kinetic and process constraints, a general nonlinear programming solver and finite element techniques have been introduced. The optimization results for the complex reactor system have been compared with those of Kumar et al. [1984] to show better optimization performance. The proposed optimizing scheme has been applied to the free end time problem to obtain the realistic operating condition. The results can supply valuable information for economic operation of the given batch esterification reactor.

• Biotechnology and Bioprocess Engineering:BBE
• /
• 제5권5호
• /
• pp.382-385
• /
• 2000

A mathematical model was developed, based on the time dependent changes of the specific growth rate, for prediction of the typical microbial cell growth in batch cultures. This model could predict both the lag growth phase and the stationary growth phase of batch cultures, and it was tested with the batch growth of Trichoderma reesei and Lactobacillus delbrueckii.

• International Journal of Reliability and Applications
• /
• 제11권1호
• /
• pp.17-22
• /
• 2010

It is desired to estimate the reliability of a system that has two subsystems connected in series where each subsystem has two components connected in parallel. A batch sequential sampling scheme is introduced. It is shown that the batch sequential sampling scheme is asymptotically optimal as the total number of units goes to infinity. Numerical comparisons indicate that the batch sequential sampling scheme performs better than the balanced sampling scheme and is nearly optimal.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.319-322
• /
• 1995

As a trend toward multi-product batch processes is increasing in Chemical Process Industry (CPI), multi-product batch scheduling has been actively studied. But the optimal production scheduling problems for multi-product batch processes are known as NP-complete. Recently Ku and Karimi [5] have studied Simulated Annealing(SA) and Jung et al.[6] have developed Modified Simulated Annealing (MSA) method which was composed of two stage search algorithms for scheduling of batch processes with UIS and NIS. Jung et al.[9] also have studied the Common Intermediate Storage(CIS) policy which have accepted as a high efficient intermediate storage policy. It can be also applied to pipeless mobile intermediate storage pacilities. In spite of these above researches, there have been no contribution of scheduling of CIS policy for chemical batch processes. In this paper, we have developed another MSA for scheduling chemical batch processes with searching the suitable control parameters for CIS policy and have tested the this algorithm with randomly generated various scheduling problems. From these tests, MSA is outperformed to general SA for CIS batch process system.