A program has been written that simulates the operation of a batch distillation process. The program has been implemented on a Hewlett-Packard 9845T minicomputer and will be used as an instructional aid in a graduate level chemistry course. The program is very user interactive and is capable of using the final conditions from one run as the initial values of the next simulation. The batch simulation is achieved by using a tray-by-tray algorithm and is equipped with three integration techniques; the Euler, the Modified Euler and the 4th order Runge-Kutta methods. The program has the capability for studying the effect of all distillation operational parameters on the efficiency and selectivity in the separation of mixtures containing up to five components.

This dissertation presents several methods for improving statistical and first principles modeling capabilities, with an emphasis on nonlinear, unsteady state batch processes. Batch process online monitoring is chosen as a main research area here due to its importance from both theoretical and practical points of view. Theoretical background and recent developments of PCA/PLS-based online monitoring methodologies are reviewed, along with fault detection metrics, and algorithm variations for different applications. The available commercial softwares are also evaluated based on the corresponding application area. A detailed Multiway PCA based batch online monitoring procedure is used as the starting point for further improvements. The issue of dynamic batch profile synchronization is addressed. By converting synchronization into a dynamic optimization problem, Dynamic Time Warping (DTW) and Derivative DTW (DDTW) show the best performance by far. To deal with the singularity point and numerical derivative estimation problems of DTW and DDTW in the presence of noise, a robust DDTW algorithm is proposed by combining Savitzky-Golay filter and DDTW algorithm together. A comparative analysis of robust DDTW and available methods is performed on simulated and real chemical plant data. As traditional Multiway PCA-based (MPCA) methods consider batch monitoring in a static fashion (fail to consider time dependency between/within process variables with respect to time), an EWMA filtered Hybrid-wise unfolding MPCA (E-HMPCA) is proposed that considers batch dynamics in the model and reduce the number of Type I and II errors in online monitoring. Chemical and biochemical batch examples are used to compare the E-HMPCA algorithm with traditional methods. First principles modeling is known to be time consuming for development. In order to increase modeling efficiency, dynamic Design of Experiments (DOE) is introduced for Dynamic Algebraic Equation (DAE) system parameter estimation. A new criterion is proposed by combining PCA and parameter sensitivity analysis (P-optimal criterion). The new criterion under certain assumptions reduce to several available criteria and is suitable for designing experiments to improve estimation of specific parameter sets. Furthermore, the criterion systematically decomposes a complex system into small pieces according to PCA. Two engineering examples (one batch, one continuous) are used to illustrate the idea and algorithm. / text

Many different types of distributed batch scheduling systems have been developed in the last decade to take advantage of the decentralization of computers and the enormous investments that many companies and educational institutions have in desktop workstations. Based on the premise that the majority of desktop workstations are significantly underutilized, distributed batch systems allow users to submit and run jobs when these workstations are available. While simpler systems determine machine availability by time of day (e.g., 5:00 p.m. to 8:00 a.m.), more sophisticated systems determine availability dynamically, migrating tasks when the availability changes. Ring Leader is a distributed batch system currently under development at Hewlett Packard. Since meeting the objectives of a distributed system rely on the intelligent use of idle workstations, good resource determination and efficient utilization decisions are a high priority for such a system. System performance will depend heavily on the process of deciding where jobs should be run. This thesis explains the development of Ring Leader's history based resource utilization scheme, and compares its performance to more simplistic algorithms. / Graduation date: 1997

Proefschrift Rijksuniversiteit Groningen. / Met lit.opg. - Met samenvatting in het Engels.

<p> A new parameter-free texture feature-based seeded region growing algorithm is proposed in this dissertation for automated segmentation of organs in abdominal MR images. This algorithm requires that a user only mouse clicks twice to identify the upper left and lower right corners of a rectangular region of interest (ROI). With this given ROI, a seed point is automatically selected based on homogeneity criteria. Intensity as well as four texture features: 20 cooccurrence texture features, Gabor texture feature, and both 20 and 3D semivariogram texture features are extracted from the image and a seeded region growing algorithm is performed on these feature spaces. A threshold is then obtained by taking a lower value just before the one which results in an ' explosion '. An optional Snake post-processing tool is also provided to obtain better organ delineation. The comparative results of the texture features and intensity are reported using both normal digital images and abdominal MR images acquired from ten patients. Comparisons of Before and After Snake are also presented. Generally, Gabor texture feature is found to perform the best among all features . The experimental results of the proposed approach show that it is fast and accurate when combined with Gabor texture feature or intensity feature and should prove a boon to production radiological batch processing. </p> / Thesis / Doctor of Philosophy (PhD)

Business process automation improves organizations’ efficiency to perform work. In existing business process management systems, process instances run independently from each other. However, synchronizing instances carrying similar characteristics, i.e., sharing the same data, can reduce process execution costs. For example, if an online retailer receives two orders from one customer, there is a chance that they can be packed and shipped together to save shipment costs. In this paper, we use concepts from the database domain and introduce data views to business processes to identify instances which can be synchronized. Based on data views, we introduce the concept of batch regions for a context-aware instance synchronization over a set of connected activities. We also evaluate the concepts introduced in this paper with a case study comparing costs for normal and batch processing. / Die Automatisierung von Geschäftsprozessen unterstützt Unternehmen, die Ausführung ihrer Prozesse effizienter zu gestalten. In existierenden Business Process Management Systemen, werden die Instanzen eines Prozesses völlig unabhängig voneinander ausgeführt. Jedoch kann das Synchronisieren von Instanzen mit ähnlichen Charakteristiken wie z.B. den gleichen Daten zu reduzierten Ausführungskosten führen. Zum Beispiel, wenn ein Onlinehändler zwei Bestellungen vom selben Kunden mit der gleichen Lieferanschrift erhält, können diese zusammen verpackt und versendet werden, um Versandkosten zu sparen. In diesem Papier verwenden wir Konzepte aus dem Datenbankbereich und führen Datensichten für Geschäftsprozesse ein, um Instanzen zu identifizieren, welche synchronisiert werden können. Auf Grundlage der Datensichten führen wir das Konzept der Batch-Regionen ein. Eine Batch-Region ermöglicht eine kontext-bewusste Instanzen-Synchronisierung über mehrere verbundene Aktivitäten. Das eingeführte Konzept wird mit einer Fallstudie evaluiert, bei der ein Kostenvergleich zwischen der normalen Prozessausführung und der Batchverarbeitung durchgeführt wird.

Submitted by Fernando Souza (fernandoafsou@gmail.com) on 2017-08-16T11:42:54Z No. of bitstreams: 1 arquivototal.pdf: 2606529 bytes, checksum: e6d5e9c7169bad77fb641468b804b962 (MD5) / Made available in DSpace on 2017-08-16T11:42:54Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 2606529 bytes, checksum: e6d5e9c7169bad77fb641468b804b962 (MD5) Previous issue date: 2016-07-04 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The problem of scheduling on a single machine, proven to be NP-hard, consists of de ning the job grouping in batches and of the sequence in which these batches will be processed on a machine. Each job is associated with a release date, a processing time, a due date, a priority level in relation to the others and a size. The machine is able to process a group of jobs (batch) simultaneously, provided that the sum of the job sizes belonging to the referred batch does not exceed the machine capacity. Each job must be processed only once and only one batch is processed at a time on the machine. In this work, we consider the objective as the minimization of total weighted tardiness, where the tardiness of a job is the di erence between its completion time and its due date, in case the job processing is nished after its due date and hence is late, or equals zero, otherwise. In the literature, this problem is usually referred to as 1jbatch; rj ; sj ; comptjPwjTj . When all jobs are available to be processed at time zero, the problem is usually represented as 1jbatch; sj ; comptjPwjTj . These problems are still poorly explored in the literature and in addition, cover a large number of variant forms. There are few studies involving the application of exact methods for solving both. Only one mathematical formulation was identi ed in the literature for these problems. Hence, four time-indexed formulations were developed to solve the aforementioned problems, one of which is capable of dealing with both problems. The results achieved by the developed models were compared between themselves and with the results of the model available in the literature. These computational results reveal that two of the proposed models obtained higher performance both in terms of quality of the solution, particularly regarding the achieved lower bounds, and in numbers of open nodes and of proven optimal solutions. / O problema de sequenciamento de lotes da produ c~ao em uma m aquina, comprovadamente tido como NP-dif cil, consiste na de ni c~ao do agrupamento de tarefas em lotes e da sequ^encia em que estes ser~ao processados em uma m aquina. Cada tarefa est a associada a uma data de libera c~ao, um tempo de processamento, uma data de entrega, um n vel de prioridade em rela c~ao as demais, e um tamanho. A m aquina e capaz de processar um conjunto de tarefas (lote) simultaneamente, contanto que a soma dos tamanhos das tarefas pertencentes ao referido lote respeite a capacidade da m aquina. Cada tarefa deve ser processada apenas uma vez e somente um lote e processado por vez na m aquina. Neste trabalho, considera-se como objetivo a minimiza c~ao do total de atrasos ponderados, onde o atraso de uma tarefa e igual ao seu tempo de t ermino menos a sua data de entrega, caso o processamento da tarefa seja nalizado ap os a sua data da entrega e, portanto, em atraso, e e igual a zero, caso contr ario. Na literatura, este problema e geralmente referenciado como 1jbatch; rj ; sj ; comptjPwjTj . Quando todas as tarefas est~ao dispon veis para serem processadas no instante de tempo zero, o problema e usualmente representado por 1jbatch; sj ; comptjPwjTj . Estes s~ao problemas ainda pouco investigados na literatura e, al em disso, abordam uma grande quantidade de variantes. Existem poucos trabalhos envolvendo a aplica c~ao de m etodos exatos para a resolu c~ao de ambos. Apenas uma formula c~ao matem atica foi identi cada na literatura para estes problemas. Dessa forma, quatro formula c~oes matem aticas com vari aveis indexadas no tempo foram desenvolvidas para resolver os problemas mencionados anteriormente, das quais uma e capaz de tratar de ambos os problemas. Os resultados alcan cados por meio dos modelos desenvolvidos foram comparados entre si e com os resultados do modelo dispon vel na literatura. Tais resultados computacionais demonstram que dois dos modelos propostos obtiveram desempenho superior tanto em termos de qualidade da solu c~ao, em especial em rela c~ao aos limites inferiores alcan cados, quanto em n umeros de n os abertos e quantidade de solu c~oes otimas comprovadas.

This diploma thesis deals with the DCE – MRI method (Dynamic contrast enhanced magnetic resonance imaging). Basic principle of magnetic resonance and pulse sequence is described. The diploma thesis focuses on the DCE method, especially on the description of the processing procedure by this method. Description of selected pharmacokinetic models is the part of this diploma thesis as well. Furthermore, description and realization of batch processing by PerfLab system is presented. For verifying purposes of the batch processing functionality real data were measured using created acquisition protocol, which is also part of the diploma thesis.

Batch reactor is an essential unit operation in almost all batch-processing industries. Different types of reaction schemes (such as series, parallel and complex) and different order of model complexity (short-cut, detailed, etc. ) result in different sets of model equations and computer coding of all possible sets of model equations is cumbersome and time consuming. In this work, therefore, a general computer program (GBRM - General Batch Reactor Model) is developed to generate all possible sets of equations automatically and as required. GBRM is tested for different types of reaction schemes and for different order of model complexity and its flexibility is demonstrated. The above GBRM computer program is lodged with Dr. I. M. Mujtaba. One of the challenges in batch reactors is to ensure desired performance of individual batch reactor operations. Depending on the requirement and the objective of the process, optimisation in batch reactors leads to different types of optimisation problems such as maximum conversion, minimum time and maximum profit problem. The reactor temperature, jacket temperature and jacket flow rate are the main control variables governing the process and these are optimised to ensure maximum benefit. In this work, an extensive study on mainly conventional batch reactor optimisation is carried out using GBRM coupled with efficient DAEs (Differential and Algebraic Equations) solver, CVP (Control Vector Parameterisation) technique and SQP (Successive Quadratic Programming) based optimisation technique. The safety, environment and product quality issues are embedded in the optimisation problem formulations in terms of constraints. A new approach for solving optimisation problem with safety constraint is introduced. All types of optimisation problems mentioned above are solved off-line, which results to optimal operating policies. The off-line optimal operating policies obtained above are then implemented as set points to be tracked on-line and various types of advanced controllers are designed for this purpose. Both constant and dynamic set points tracking are considered in designing the controllers. Here, neural networks are used in designing Direct Inverse and Inverse-Model-Based Control (IMBC) strategies. In addition, the Generic Model Control (GMC) coupled with on-line neural network heat release estimator (GMC-NN) is also designed to track the optimal set points. For comparison purpose, conventional Dual Mode (DM) strategy with PI and PID controllers is also designed. Robustness tests for all types of controllers are carried out to find the best controller. The results demonstrate the robustness of GMC-NN controller and promise neural controllers as potential robust controllers for future. Finally, an integrated framework (BATCH REACT) for modelling, simulation, optimisation and control of batch reactors is proposed.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Problems of scheduling on batch processing machines to minimize makespan are widely exploited by academic literature, mainly motivated by reliability testing in the semiconductor industry. These problems consist in grouping jobs as a batch and scheduling the processing in single or parallel machines. The jobs have non-identical processing times and non-identical sizes and the total size of the batch cannot exceed the machine capacity. The processing time of a batch is given by the longest processing time of any job in the batch. Jobs with nonidentical release times can also be considered, and in this case a batch can only be processed after the job with the longest release time in the batch is available. We consider four different problems of scheduling on batch processing machines with non-identical job size and different characteristics: single batch processing machine (1|sj,B|Cmax), single batch processing machine with non-identical job release times (1|rj,sj,B|Cmax), identical parallel batch processing machines (Pm|sj,B|Cmax), and identical parallel batch processing machines with non-identical job release times (Pm|rj,sj,B|Cmax). New mathematical models are proposed with formulations that exploit characteristics of each problem. The mathematical models are solved using CPLEX and the computational results show that the proposed models performed better than other models from literature. The new models for 1|sj,B|Cmax and 1|rj,sj,B|Cmax are compared with previously published meta-heuristics and the results show that the models provide better solutions than meta-heuristics methods with competitive computational times. / Problemas de minimização do makespan no dimensionamento e programação de bateladas em máquinas de processamento são extensamente explorados pela literatura acadêmica, motivados principalmente por testes de confiabilidade na indústria de semicondutores. Estes problemas consistem em agrupar tarefas em bateladas e programar o processamento em uma ou mais máquinas em paralelo. As tarefas possuem tempos de processamento e tamanhos não idênticos e o tamanho total da batelada não pode exceder a capacidade da máquina. Para cada batelada é definido um tempo de processamento que será igual ao maior tempo de processamento das tarefas que foram alocadas a ela. As tarefas podem considerar também tarefas com tempos de liberação não idênticos, neste caso as bateladas só poderão ser processadas depois que a tarefa com o maior tempo de liberação for disponibilizada. Este trabalho aborda quatro diferentes problemas de dimensionamento e programação de bateladas com tarefas de tamanhos não idênticos, que consideram diferentes características: máquina de processamento única (1|sj,B|Cmax), máquina de processamento única e tarefas com tempos de liberação não idênticos (1|rj,sj,B|Cmax), máquinas de processamento paralelas idênticas (Pm|sj,B|Cmax) e máquinas de processamento paralelas idênticas e tarefas com tempos de liberação não idênticos (Pm|rj,sj,B|Cmax). São propostos novos modelos matemáticos com formulações que exploram características de cada problema. Os modelos matemáticos são resolvidos utilizando CPLEX e os resultados computacionais comprovam que os modelos propostos possuem um desempenho melhor do que outros modelos da literatura. Os modelos propostos para 1|sj,B|Cmax e 1|rj,sj,B|Cmax são comparados com meta-heurísticas previamente publicadas e os resultados mostram que os novos modelos oferecem soluções melhores com tempos computacionais competitivos.