The hybrid or flexible flowshop problem is a generalization of the flowshop in such a way
that every job can be processed by one among several machines on each machine stage. In …

Constraint Programming is a problem-solving paradigm that establishes a clear distinction
between two pivotal aspects of a problem:(1) a precise definition of the constraints that …

The aim of this paper is to present a new branch and bound method for solving the Multi-
Processor Flow-Shop. This method is based on the relaxation of the initial problem to m …

This paper presents a set of satisfiability tests and time‐bound adjustmentalgorithms that
can be applied to cumulative scheduling problems. An instance of thecumulative scheduling …

This paper shows that the use of satisfiability tests and time-bound adjustments based on
energetic reasoning and global operations can enhance the efficiency of branch and bound …

In recent years, constraint satisfaction techniques have been successfully applied to
“disjunctive” scheduling problems, ie, scheduling problems where each resource can …

We consider the multistage hybrid flowshop scheduling problem, in which each stage
consists of parallel identical machines. The problem is to determine a schedule that …

This paper presents a set of propagation rules to solve cumulative constraints. As in our
previous paper on jobshop scheduling [8], our goal is to propose to the CLP community …

We consider the problem of minimizing the makespan on identical parallel machines subject
to release dates and delivery times. The objective of this paper is to develop exact branch …

Edge-finding bounding techniques are particular constraint propagation techniques which
reason about the order in which several activities can execute on a given resource. The aim …