activity
20072026
most citedSolving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation

9 citations · 15 across the 6 of their papers we have counts for

collaborators

6 papers

cs.AI2026

Global Difference Constraint Propagation for Constraint Programming

Lucas Kletzander, Jip J. Dekker, Andreas Schutt +1

Difference constraints of the form are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths. Finit…

cs.AI2022★ 4 cited

Movement Analytics: Current Status, Application to Manufacturing, and Future Prospects from an AI Perspective

Peter Baumgartner, Daniel Smith, Mashud Rana +6

Data-driven decision making is becoming an integral part of manufacturing companies. Data is collected and commonly used to improve efficiency and produce high quality items for th…

cs.AI2015★ 2 cited

A Constraint Programming Approach for Non-Preemptive Evacuation Scheduling

Caroline Even, Andreas Schutt, Pascal Van Hentenryck

Large-scale controlled evacuations require emergency services to select evacuation routes, decide departure times, and mobilize resources to issue orders, all under strict time con…

cs.AI2012

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

Andreas Schutt, Thibaut Feydy, Peter J. Stuckey

Cumulative resource constraints can model scarce resources in scheduling problems or a dimension in packing and cutting problems. In order to efficiently solve such problems with a…

cs.AI2010★ 9 cited

Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation

Andreas Schutt, Thibaut Feydy, Peter J. Stuckey +1

The technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized preceden…

cs.DS2007

Incremental Satisfiability and Implication for UTVPI Constraints

Andreas Schutt, Peter J. Stuckey

Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints which are polynomial time solvable (unless P=NP). There is considerable in…