Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
DOI10.1016/j.artint.2014.04.001zbMath1407.90150OpenAlexW2003475445MaRDI QIDQ2453730
Jean-Guillaume Fages, Tanguy Lapègue
Publication date: 10 June 2014
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.04.001
global constraintsAtMostNValueconstraint-programmingshift minimisation personnel task scheduling problem
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for large scale shift minimisation personnel task scheduling problems
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- Filtering algorithms for the NValue constraint
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Global constraint catalogue: past, present and future
- Dynamic structural symmetry breaking for constraint satisfaction problems
- Reasoning from last conflict(s) in constraint programming
- Staff rostering at a large international airport
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Staff scheduling and rostering: a review of applications, methods and models.
- Algorithmic graph theory and perfect graphs
- Personnel scheduling: a literature review
- On the reification of global constraints
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- Generalizing AllDifferent: The SomeDifferent Constraint
- Interval scheduling: A survey
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- When Is the Classroom Assignment Problem Hard?
- On the Shannon capacity of a graph
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
- CSDP, A C library for semidefinite programming
- Algorithm 457: finding all cliques of an undirected graph
- Exploring the complexity boundary between coloring and list-coloring
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
