The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Flow Polyhedra and Resource Constrained Project Scheduling Problems”

Optimization of an SMD placement machine and flows in parametric networks

Katarína Cechlárová, Tamás Fleiner (2011)

Kybernetika

Similarity:

In the minimization of the number of subtours made by the insertion head of an SMD placement machine a variant of the network flow problem arose. In a network with n vertices and m arcs a set F of arcs (parametrized arcs) is given. The task is to find a flow of a given size such that the maximum of flow values along the arcs from F is minimized. This problem can be solved by a sequence of maximum flow computations in modified networks where the capacities of the parametrized arcs are...

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities

Samuel Deleplanque, Safia Kedad-Sidhoum, Alain Quilliot (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to designing a Lagrangean based heuristic. Numerical experiments showing the efficiency of the proposed...

Numerical approximation of aeroacoustics induced by flow over a square cylinder

Marhan, Tomáš, Sváček, Petr

Similarity:

This study investigates the generation of aeroacoustic sound resulting from the interaction of flow with a square cylinder at a Reynolds number of 150 and a Mach number of 0.2. The analysis combines the Finite Volume Method (FVM) for fluid dynamics using the OpenFOAM framework with the Finite Element Method (FEM) for acoustics implemented via the FEniCS Python library.

Separable convexification and DCA techniques for capacity and flow assignment problems

P. Mahey, Thai Q. Phong, H. P.L. Luna (2010)

RAIRO - Operations Research

Similarity:

We study a continuous version of the capacity and flow assignment problem (CFA) where the design cost is combined with an average delay measure to yield a non convex objective function coupled with multicommodity flow constraints. A separable convexification of each arc cost function is proposed to obtain approximate feasible solutions within easily computable gaps from optimality. On the other hand, DC (difference of convex functions) programming can be used to compute accurate upper...