• Title/Summary/Keyword: batch processor

Search Result 12, Processing Time 0.035 seconds

A Batch Scheduling Problem for Jobs with Interval-typed Processing Time (구간 공정 시간을 갖는 작업들의 일괄처리 일정계획문제)

  • 오세호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.27 no.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.

CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS

  • Kim, Jeong-Sim
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.6
    • /
    • pp.1251-1258
    • /
    • 2010
  • For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.

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

  • Oh, Se-Ho;Lee, Keun-Bu
    • 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.

Satellite's orbit tracking with batch estimation

  • Kim, Jong-Ah;Kim, Jin-Ho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.224-228
    • /
    • 1994
  • This paper deals with a Batch processor application to determine orbit trajectories from satellite tracking data. The purpose of this paper is to find the initial state vectors. In order to determine the better estimation process, several different cases are compared. Here we adapt a minimum variance concept to develop estimation and prediction techniques. These results are compared with by SEP, Spherical Error Probable, values.

  • PDF

A Batching Problem to minimize the total Tardiness with Dynamic Arrivals (동적 도착의 총 납기 지연 최소화 문제)

  • Oh Se-Ho;Lee Keun-Boo;Yang Hee-Joon
    • 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.

ON THE DEVELOPMENT OF A DISTILLATION PROCESS FOR THE ELECTROMETALLURGICAL TREATMENT OF IRRADIATED SPENT NUCLEAR FUEL

  • Westphal, Brian R.;Marsden, Kenneth C.;Price, John C.;Laug, David V.
    • Nuclear Engineering and Technology
    • /
    • v.40 no.3
    • /
    • pp.163-174
    • /
    • 2008
  • As part of the spent fuel treatment program at the Idaho National Laboratory, a vacuum distillation process is being employed for the recovery of actinide products following an electrorefining process. Separation of the actinide products from a molten salt electrolyte and cadmium is achieved by a batch operation called cathode processing. A cathode processor has been designed and developed to efficiently remove the process chemicals and consolidate the actinide products for further processing. This paper describes the fundamentals of cathode processing, the evolution of the equipment design, the operation and efficiency of the equipment, and recent developments at the cathode processor. In addition, challenges encountered during the processing of irradiated spent nuclear fuel in the cathode processor will be discussed.

Database for an Integrated Structural Design of Buildings (건축구조설계의 통합시스템을 위한 데이타베이스의 구축)

  • 김이두;최창근
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1991.04a
    • /
    • pp.50-55
    • /
    • 1991
  • This paper presents database technique for an computer-integrated structural design system of buildings. Network database designed to support all the processes of structural design, such as, planning, modelling, analysis, member design and redesign processes etc. stores all information from user input and system results effectively and so provides centeral communication area between applications. The user interface wi th interactive and batch modes plays roles of building modeler including conventional pre-processor and post-processor. The concepts of 'Planar Surface Modeling' and 'Geometry Zoning' are defined for easy construction of building model. The concept presented in this paper will save the time and memory required for model generation and contribute to data consistency, thus leave a designer more time actually performing the analyses and interpreting the results. The formulation of automating the process of bulilding model ins and structural analysis is the key to study.

  • PDF

The Development of a MATLAB-based Discrete Event Simulation Framework for the Engagement Simulations of the Weapon Systems (무기체계 교전 시뮬레이션을 위한 매트랩 기반 이산사건시뮬레이션 프레임워크의 개발)

  • Hwang, Kun-Chul;Lee, Min-Gyu;Kim, Jung-Hoon
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.2
    • /
    • pp.31-39
    • /
    • 2012
  • Simulation Framework is a basic software tool used to develop simulation applications. This paper describes the development of a discrete event simulation framework based on DEVS(Discrete EVent System Specification) formalism, using MATLAB language which is widely used in technical computing and engineering disciplines. The newly developed framework utilizing MATLAB object oriented programming combines the convenience of MATLAB language and the sophisticated architecture of the DEVS formalism. Hence, it supports the productivity, flexibility, extensibility that are required for the simulation application software development of the weapon systems engagement. Moreover, it promises a simulation application the increased the computation speed proportional to the number of CPU of a multi-core processor, providing the batch simulation functionality based on MATLAB parallel computing technology.

Real-Time Scheduling System Re-Construction for Automated Manufacturing in a Korean 300mm Wafer Fab (반도체 자동화 생산을 위한 실시간 일정계획 시스템 재 구축에 관한 연구 : 300mm 반도체 제조라인 적용 사례)

  • Choi, Seong-Woo;Lee, Jung-Seung
    • Journal of Intelligence and Information Systems
    • /
    • v.15 no.4
    • /
    • pp.213-224
    • /
    • 2009
  • This paper describes a real-time scheduling system re-construction project for automated manufacturing at a 300mm wafer fab of Korean semiconductor manufacturing company. During executing this project, for each main operation such as clean, diffusion, deposition, photolithography, and metallization, each adopted scheduling algorithm was developed, and then those were implemented in a real-time scheduling system. In this paper, we focus on the scheduling algorithms and real-time scheduling system for clean and diffusion operations, that is, a serial-process block with the constraint of limited queue time and batch processors. After this project was completed, the automated manufacturing utilizations of clean and diffusion operations became around 91% and 83% respectively, which were about 50% and 10% at the beginning of this project. The automated manufacturing system reduces direct operating costs, increased throughput on the equipments, and suggests continuous and uninterrupted processings.

  • PDF

Development of an Object-oriented Finite Element Model through Iterative Method Ensuring Independency of Elements (요소 독립성이 유지되는 반복해법에 의한 객체지향 유한요소모델 개발)

  • Lee, Han-Ki;Kim, Tae-Gon;Lee, Jeong-Jae
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.54 no.2
    • /
    • pp.115-125
    • /
    • 2012
  • Application of the Object-oriented Programming (OOP) method to the Finite Element Model (FEM) program has various strengths including the features of encapsulation, polymorphism and inheritance. However, this technique should be based upon a premise that the independency of the object method and data to be used is guaranteed. By attempting to apply the OOP to the FEM, existing researches go against the independency of the OOP which is an essential feature of the method. The reason is this: existing researches apply the OOP to modules in accordance with analysis procedures, although the data to be used is classified as an element unit in the FEM. Therefore, the required independency cannot be maintained as whole stiffness matrices and boundary conditions are combined together. Also, solutions are sought from analysis module after data is regrouped at the pre-processor, and their results are analyzed during the post-processor. As this is similar to a batch processing, it cannot use data at analysis, and recalculation should be done from the beginning if any condition is changed after the analysis is complete, which are limitations of the existing researches. This research implemented the Object-orientation of elements so that the three features of the OOP (i.e. encapsulation, polymorphism and inheritance) can be guaranteed and their independency maintained as a result. For this purpose, a model called 'Object-oriented Finite element Model ensuring the Independency of Elements (OFMIE)', which enables the analysis of targets through mutual data exchanges within instance, was developed. In conclusion, the required independency was achieved in the instance of the objected elements and the analysis results of previous conditions could be used for the analysis after changes. The number of repetitive calculations was reduced by 75 per cent through this gradual analysis processes.