Constraint - based scheduling : applying constraint programming to scheduling problems

By P. Baptiste, Claude Le Pape, Wim P. M. Nuijten. 2001

568 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/e097d2528a1b4e42a038e3851a0a8b00ab4d6841

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Philippe Laborie
2. Ari Kristinn Jónsson
3. Jeremy D. Frank

In Industrial and Manufacturing Engineering

1. Philippe Laborie
2. Jeremy D. Frank
3. Ari Kristinn Jónsson

Citations in the corpus

• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results (2003, background): “• @BULLETA, R 2 , q = [2] [3], AfterEnd is a resource constraint that states that activity A will produce 2 or 3 units of reservoir (this is a decision variable of the problem) R 2 at its end time.”
• Integration of production planning and scheduling: Overview, challenges and opportunities (2009, unknown): “For example, Constraint Programming (CP) scheduling models have been used widely (Baptiste et al., 2001; Hooker, 2006). In this case, however, the integrated model will be a hybrid MIP/CP model, which means that a special solution strategy will be required. A recent review of scheduling formulations”
• Project scheduling with finite or infinite number of activity processing modes - A survey (2011, unknown): “, 1999), and extensively discussed in (Baptiste et al., 2001).”