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.

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.

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.

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.

A semi-Lagrangian finite volume method for solving viscoelastic flow problems

Recently, there has been considerable interest in solving viscoelastic problems in 3D particularly with the improvement in modern computing power. In many applications the emphasis has been on economical algorithms which can cope with the extra complexity that the third dimension brings. Storage and computer time are of the essence. The advantage of the finite volume formulation is that a large amount of memory space is not required. Iterative methods rather than direct methods can be used to solve the resulting linear systems efficiently.