Abstract IBM ILOG CP Optimizer is a generic CP-based system to model and solve
scheduling problems. It provides an algebraic language with simple mathematical concepts …

Providing robust scheduling algorithms that can solve a large variety of scheduling problems
with good performance is one of the biggest challenge of practical schedulers today. In this …

This paper presents a Large Neighborhood Search (LNS) approach based on constraint
programming to solve cumulative scheduling problems. It extends earlier work on constraint …

Railway scheduling has been a significant issue in the railway industry. Over the last few
years, numerous approaches and tools have been developed to compute railway …

Uncertainty has a significant impact on the stability and performance of engineering-to-order
(ETO) production systems by affecting due date achievement, efficient resource allocation …

Abstract In version 2.0, IBM ILOG CP Optimizer has been extended by the introduction of
scheduling support based on the concept of optional interval variables. This paper formally …

Constraint-based approaches to scheduling have typically formulated the problem as one of
finding a consistent assignment of start times for each goal activity. In contrast, we are …

This paper describes how explicit resource reasoning is added within an existing temporal
planning framework that uses timelines as plan representation. The work is grounded on a …

The resource-constrained project scheduling problem with minimum and maximum time
lags (RCPSP/max) is a general model for resource scheduling in many real-world problems …

Over the last decades, many approaches have been developed for application to a variety of
different scheduling problems. Most of these techniques assume erroneously a complete …