background: constructed wetlands (cw s ) are mimic filtration process in natural wetlands that effectively remove variety pollutants from wastewater. the main objective was the feasibility evaluation for using of subsurface flow constructed wetland in nitrogen and phosphorus removal from synthetic based on domestic wastewater in lab scale. methods: in this study, a synthetic wetland subsurface ...

BACKGROUND Little is known about blood flow and its relationship to respiration during exercise in patients with total cavopulmonary connection (TCPC). METHODS AND RESULTS We studied 11 patients 12.4+/-4.6 years (mean+/-SD) of age 5.9+/-2.8 years (mean+/-SD) after TCPC operation. Real-time MRI was used to measure blood flow in the superior vena cava (SVC), inferior vena cava (IVC), and ascend...

In this paper, we present a constructive heuristic to minimize total flow time criterion for the well-known NP-hard no-wait flow shop scheduling problem. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. The initial sequence of jobs thus generated is further improved using a new job insertion ...

A variety of metaheuristics have been developed to solve the permutation flow shop problem minimizing total flow time. Iterated local search (ILS) is a simple but powerful metaheuristic used to solve this problem. Fundamentally, ILS is a procedure that needs to be restarted from another solution when it is trapped in a local optimum. A new solution is often generated by only slightly perturbing...

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS) problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (F...

We consider offline algorithms for minimizing the total flow time on O(1) machines where jobs can be preempted arbitrarily but migrations are disallowed. Our main result is a quasipolynomial time approximation scheme for minimizing the total flow time. We also consider more general settings and give some hardness results.

The standard economic theory suggests that capital should flow from rich to poor countries, unless the poor countries have lower overall productivity (Lucas, 1990) or a higher relative cost of investment (Caselli and Feyrer, 2007). Another prediction of the standard theory, arguably less controversial, is that capital should flow into countries undergoing a sustained increase in total factor pr...

A gas inside the microsystems or the porous media is in its non-equilibrium state, due to the fact that the molecular mean free path is comparable to the characteristic dimension of the media. The same state of a gas, called rarefied, is found at high altitude or in the vacuum equipment working at low pressure. All these types of flow can be described by the kinetic models derived from the Bolt...

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes ...