Corpus ID: 6888742

Dynamic Sweep Filtering Algorithm for FlexC

@article{Derrien2014DynamicSF,
  title={Dynamic Sweep Filtering Algorithm for FlexC},
  author={Alban Derrien and Thierry Petit and S. Zampelli},
  journal={ArXiv},
  year={2014},
  volume={abs/1408.5377}
}
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. 
A Declarative Paradigm for Robust Cumulative Scheduling
TLDR
A new declarative characterization of robustness is presented, which preserves solution quality and highlights the significance of the framework on a crane assignment problem with business constraints. Expand

References

SHOWING 1-8 OF 8 REFERENCES
A Declarative Paradigm for Robust Cumulative Scheduling
TLDR
A new declarative characterization of robustness is presented, which preserves solution quality and highlights the significance of the framework on a crane assignment problem with business constraints. Expand
A Scalable Sweep Algorithm for the cumulative Constraint
TLDR
This paper presents a sweep based algorithm for the cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode, and scales well in practice, even when a significant number of tasks can be scheduled in parallel. Expand
The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach
TLDR
A novel approach based on constraint programming which is able to model many realistic operational constraints is proposed which is richer than the state of the art in the operations research community. Expand
Introducing global constraints in CHIP
The purpose of this paper is to show how the introduction of new primitive constraints (e.g., among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result inExpand
Passage à l'échelle pour les contraintes d'ordonnancement multi-ressources. (Scalable multi-dimensional resources scheduling constraints)
TLDR
Pour atteindre cet objectif, nous utilisons l’idee de balayage synchronise considerant simultanement une conjonction de contraintes cumulative and des precedences, ce qui nous permet d’accelerer the convergence au point fixe. Expand
Passage à l’échelle pour les contraintes d’o rdonnancement multi-ressources
  • Ph.D dissertation,
  • 2013
Introducing global const raints in CHIP.Journal of Mathematical and Computer Modelling
  • 1994
Introducing global constraints in CHIP
  • Journal of Mathematical and Computer Modelling