### Adaptive Rigidification of Elastic Solids

**Abstract:** We present a method for reducing the computational cost of elastic solid simulation by treating connected sets of non-deforming elements as rigid bodies. Non-deforming elements are identified as those where the strain rate squared Frobenius norm falls below a threshold for several frames. Rigidification uses a breadth first search to identify connected components while avoiding connections that would form hinges between rigid components. Rigid elements become elastic again when their approximate strain velocity rises above a threshold, which is fast to compute using a single iteration of conjugate gradient with a fixed Laplacian-based incomplete Cholesky preconditioner. With rigidification, the system size to solve at each time step can be greatly reduced, and if all elastic element become rigid, it reduces to solving the rigid body system. We demonstrate our results on a variety of 2D and 3D examples, and show that our method is likewise especially beneficial in contact rich examples.

### The CONFIDENCE Constraint: A Step Towards Stochastic CP Solvers

**Abstract:** We introduce the CONFIDENCE constraint, a chance constraint that ensures, with probability γ, that a set of variables are no smaller than random variables for which the probability distribution is given. This constraint is useful in stochastic optimization to ensure that a solution is robust to external random events. It allows to control the trade-off between optimizing the objective function and ensuring the satisfiability of the solution under random parameters. We present a filtering algorithm for this constraint with explanations. We apply the constraint to a case study, an industrial scheduling problem where tasks have random processing times due to possible breakdowns during their execution. We evaluate our solutions with simulations and show that this new constraint allows robust solutions in decent computation time.

### Leveraging Constraint Scheduling: A Case Study to the Textile Industry

**Abstract:** Despite the significant progress made in scheduling in the
past years, industrial problems with several hundred tasks remain intractable
for some variants of the scheduling problems. We present techniques
that can be used to leverage the power of constraint programming
to solve an industrial problem with 800 non-preemptive tasks, 90
resources, and sequence-dependent setup times. Our method involves
solving the traveling salesperson problem (TSP) as a simplification of
the scheduling problem and using the simplified solution to guide the
branching heuristics. We also explore large neighborhood search. Experiments
conducted on a dataset provided by our partner from the textile
industry show that we obtain non-optimal but satisfactory solutions.

### Multi-Resource Scheduling with Setup Times: An Application Case to the Textile Industry

In the textile industry, the looms are now automatic, but what is left to be automated is the scheduling process. This paper is about the scheduling of the looms and workers doing the setup between two jobs. We explain the problem, tools, methodologies, and constraints to solve this NP-Hard problem. As of now, this is a work in progress.