Displaying similar documents to “The Flow Networks Approach to Decision Analysis in Construction Industry”

Flow Polyhedra and Resource Constrained Project Scheduling Problems

Alain Quilliot, Hélène Toussaint (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper aims at describing the way Flow machinery may be used in order to deal with Resource Constrained Project Scheduling Problems (RCPSP). In order to do it, it first introduces the Timed Flow Polyhedron related to a RCPSP instance. Next it states several structural results related to connectivity and to cut management. It keeps on with a description of the way this framework gives rise to a generic Insertion operator, which enables programmers to design greedy and local search...

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...

Reliability-based economic model predictive control for generalised flow-based networks including actuators' health-aware capabilities

Juan M. Grosso, Carlos Ocampo-Martinez, Vicenç Puig (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper proposes a reliability-based economic model predictive control (MPC) strategy for the management of generalised flow-based networks, integrating some ideas on network service reliability, dynamic safety stock planning, and degradation of equipment health. The proposed strategy is based on a single-layer economic optimisation problem with dynamic constraints, which includes two enhancements with respect to existing approaches. The first enhancement considers chance-constraint...

The inverse maximum flow problem considering norm

Adrian Deaconu (2008)

RAIRO - Operations Research

Similarity:

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast ⋅log()) time complexity algorithm for solving this problem is presented, where is the number of arcs and is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The...