Dynamic Sweep Filtering Algorithm for FlexC

08/22/2014
by   Alban Derrien, et al.
0

We investigate cumulative scheduling in uncertain environments, using constraint programming. We detail in this paper the dynamic sweep filtering algorithm of the FlexC global constraint.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2009

The Soft Cumulative Constraint

This research report presents an extension of Cumulative of Choco constr...
research
04/22/2013

Three Generalizations of the FOCUS Constraint

The FOCUS constraint expresses the notion that solutions are concentrate...
research
02/25/2017

Contractibility for Open Global Constraints

Open forms of global constraints allow the addition of new variables to ...
research
11/28/2016

The BIN_COUNTS Constraint: Filtering and Applications

We introduce the BIN_COUNTS constraint, which deals with the problem of ...
research
07/04/2019

A global constraint for the capacitated single-item lot-sizing problem

The goal of this paper is to set a constraint programming framework to s...
research
05/03/2021

Bounds of MIN_NCC and MAX_NCC and filtering scheme for graph domain variables

Graph domain variables and constraints are an extension of constraint pr...
research
08/15/2012

Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint

Cumulative resource constraints can model scarce resources in scheduling...

Please sign up or login with your details

Forgot password? Click here to reset