Parametrical modeling and design optimization of blood plasma separation device with microchannel mechanism

This paper presents an analysis of biofluid behavior in a T-shaped microchannel device and a design optimization for improved biofluid performance in terms of particle liquid separation. The biofluid is modeled with single phase shear rate non-Newtonian flow with blood property. The separation of red blood cell from plasma is evident based on biofluid distribution in the microchannels against various relevant effects and findings, including Zweifach-Fung bifurcation law, Fahraeus effect, Fahraeus-Lindqvist effect and cell free phenomenon. The modeling with the initial device shows that this T-microchannel device can separate red blood cell from plasma but the separation efficiency among different bifurcations varies largely. In accordance with the imbalanced performance, a design optimization is conducted. This includes implementing a series of simulations to investigate the effect of the lengths of the main and branch channels to biofluid behavior and searching an improved design with optimal separation performance. It is found that changing relative lengths of branch channels is effective to both uniformity of flow rate ratio among bifurcations and reduction of difference of the flow velocities between the branch channels, whereas extending the length of the main channel from bifurcation region is only effective for uniformity of flow rate ratio.

Computational modeling of mold filling and related free-surface flows in shape casting: an overview of the challenges involved

Accurate representation of the coupled effects between turbulent fluid flow with a free surface, heat transfer, solidification, and mold deformation has been shown to be necessary for the realistic prediction of several defects in castings and also for determining the final crystalline structure. A core component of the computational modeling of casting processes involves mold filling, which is the most computationally intensive aspect of casting simulation at the continuum level. Considering the complex geometries involved in shape casting, the evolution of the free surface, gas entrapment, and the entrainment of oxide layers into the casting make this a very challenging task in every respect. Despite well over 30 years of effort in developing algorithms, this is by no means a closed subject. In this article, we will review the full range of computational methods used, from unstructured finite-element (FE) and finite-volume (FV) methods through fully structured and block-structured approaches utilizing the cut-cell family of techniques to capture the geometric complexity inherent in shape casting. This discussion will include the challenges of generating rapid solutions on high-performance parallel cluster technology and how mold filling links in with the full spectrum of physics involved in shape casting. Finally, some indications as to novel techniques emerging now that can address genuinely arbitrarily complex geometries are briefly outlined and their advantages and disadvantages are discussed.

Multiscale modeling of the onset of freckle formation during vacuum arc remelting

A multiscale model for the Vacuum Arc Remelting process (VAR) was developed to simulate dendritic microstructures during solidification and investigate the onset of freckle formation. On the macroscale, a 3D multi-physics model of VAR was used to study complex physical phenomena, including liquid metal flow with turbulence, heat transfer, and magnetohydrodynamics. The results showed that unsteady fluid flow in the liquid pool caused significant thermal perturbation at the solidification front. These results were coupled into a micromodel to simulate dendritic growth controlled by solute diffusion, including local remelting. The changes in Rayleigh number as the microstructure remelts was quantified to provide an indicator of when fluid flow channels (i.e. freckles) will initiate in the mushy zone. By examining the simulated microstructures, it was found that the Rayleigh number increased more than 300 times during remelting, which suggests that thermal perturbation could be responsible for the onset of freckle formation.

Multi-physics modeling of aluminium reduction cells

Aluminium cells involve a range of complex physical processes which act simultaneously to provide a narrow satisfactory operating range. These processes involve electromagnetic fields, coupled with heat transfer and phase change, two phase fluid flow with a range of complexities plus the development of stress in the cell structure. All of these phenomena are coupled in some significant sense and so to provide a comprehensive model of these processes involves their representation simultaneously. Conventionally, aspects of the process have been modeled separately using uncoupled estimates of the effects of the other phenomena; this has enabled the use of standard commercial CFD and FEA tools. In this paper we will describe an approach to the modeling of aluminium cells which describes all the physics simultaneously. This approach uses a finite volume approximation for each of the phenomena and facilitates their interactions directly in the modeling-the complex geometries involved are addressed by using unstructured meshes. The very challenging issues to be overcome in this venture will be outlined and some preliminary results will be shown.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

A two-dimensional numerical investigation of the oscillatory flow behaviour in rectangular fire compartments with a single horizontal ceiling vent

This paper presents a comparison of fire field model predictions with experiment for the case of a fire within a compartment which is vented (buoyancydriven) to the outside by a single horizontal ceiling vent. Unlike previous work, the mathematical model does not employ a mixing ratio to represent vent temperatures but allows the model to predict vent temperatures a priori. The experiment suggests that the flow through the vent produces oscillatory behaviour in vent temperatures with puffs of smoke emerging from the fire compartment. This type of flow is also predicted by the fire field model. While the numerical predictions are in good qualitative agreement with observations, they overpredict the amplitudes of the temperature oscillations within the vent and also the compartment temperatures. The discrepancies are thought to be due to three-dimensional effects not accounted for in this model as well as using standard ‘practices’ normally used by the community with regards to discretization and turbulence models. Furthermore, it is important to note that the use of the k–ε turbulence model in a transient mode, as is used here, may have a significant effect on the results. The numerical results also suggest that a linear relationship exists between the frequency of vent temperature oscillation (n) and the heat release rate (Q0) of the type n∝Q0.290, similar to that observed for compartments with two horizontal vents. This relationship is predicted to occur only for heat release rates below a critical value. Furthermore, the vent discharge coefficient is found to vary in an oscillatory fashion with a mean value of 0.58. Below the critical heat release rate the mean discharge coefficient is found to be insensitive to fire size.

Liquid metal turbulent flow dynamics in a cylindrical container with free surface: experiment and numerical analysis

The liquid metal flow in induction crucible models is known to be unstable, turbulent and difficult to predict in the regime of medium frequencies when the electromagnetic skin-layer is of considerable extent. We present long term turbulent flow measurements by a permanent magnet incorporated potential difference velocity probe in a cylindrical container filled with eutectic melt In-Ga-Sn. The parallel numerical simulation of the long time scale development of the turbulent average flow is presented. The numerical flow model uses an implicit pseudo-spectral code and k-w turbulence model, which was recently developed for the transitional flow modelling. The results compare reasonably to the experiment and demonstrate the time development of the turbulent flow field and the turbulence energy.

Buoyancy driven flow and its stability in a horizontal rectangular channel with an arbitrary oriented transversal magnetic field

An MHD flow is considered which is relevant to horizontal Bridgman technique for crystal growth from a melt. In the unidirectional parallel flow approximation an analytical solution is found accounting for the finite rectangular cross section of the channel in the case of a vertical magnetic field. Numerical pseudo-spectral solutions are used in the cases of arbitrary magnetic field and gravity vector orientations. The vertical magnetic field (parallel to the gravity) is found to be he most effective to damp the flow, however, complicated flow profiles with "overvelocities" in the comers are typical in the case of a finite cross-section channel. The temperature distribution is shown to be dependent on the flow profile. The linear stability of the flow is investigated by use of the Chebyshev pseudospectral method. For the case of an infinite width channel the transversal rolls instability is investigated, and for the finite cross-section channel the longitudinal rolls instability is considered. The critical Gr number values are computed in the dependence of the Ha number and the wave number or the aspect ratio in the case of finite section.

Liquid metal turbulent flow dynamics in a cylindrical container with free surface: experiment and numerical analysis

The liquid metal flow in inducation crucible models is known to be higly unstable and turbutlen in the regim e of medium frequecies when the elctronmagnetic skin-layer is of considerable extent. We present long term turbulent flow measurements by a permanent magnet incorporated potential difference veolocity probe in a cylindirical container filled with eutecti mlt In-Ga-SN. The parallel numerical simulation of the long time scale development of the turbulen average flow is presented. The numerical lfow model uses a pseud-spectral code and k-w turbulence model, which was recently developed for the transitional flow modelling. The result compare reasonably to the experiment and demonstrate the time development of the turbulent flow field.

Proportionate flow shop with controllable processing times

This paper considers a special class of flow-shop problems, known as the proportionate flow shop. In such a shop, each job flows through the machines in the same order and has equal processing times on the machines. The processing times of different jobs may be different. It is assumed that all operations of a job may be compressed by the same amount which will incur an additional cost. The objective is to minimize the makespan of the schedule together with a compression cost function which is non-decreasing with respect to the amount of compression. For a bicriterion problem of minimizing the makespan and a linear cost function, an O(n log n) algorithm is developed to construct the Pareto optimal set. For a single criterion problem, an O(n2) algorithm is developed to minimize the sum of the makespan and compression cost. Copyright © 1999 John Wiley & Sons, Ltd.

Scheduling batches with sequential job processing for two-machine flow and open shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.

Two-machine flow shop scheduling problems with no-wait jobs

In this paper we provide a fairly complete complexity classification of various versions of the two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. For some version, we offer a fully polynomial-time approximation scheme and a 43-approximation algorithm.

An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter

We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables

An approximation algorithm for the two-machine flow shop with a single transporter

We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables.