Search

Synchronizing heterogeneous processes remains a difficult issue in Scheduling area. Related ILP models are in trouble. So we propose here a pipe-line collaboration of a dynamic programming process for energy production and consumption scheduling.

The emergence of H2 energy produced through photolysis makes appear a new generation of local energy players, which are at the same time producers and consumers. This raises the question of synchronizing H2 production, which deeply depends on the time, and its consumption through some transportation activity. We deal here with this issue, in the context of an experimental H2 production platform, through dynamic programming augmented with ad hoc filtering devices.

In this paper we describe a Branch-and-Cut algorithm for the k-edge connected subgraph problem. This problem has applications in the design of survivable telecommunication networks. We introduce a new family of valid inequalities for the associated polytope. We give sufficient conditions for these inequalities to be facet defining and devise separation heuristics to separate them. We present further classes of valid inequalities and also discuss some reduction operations that can be used in a preprocessing phase for the separation. Using these results, we develop a Branch-and-Cut algorithm and present some computational results.