This paper presents a new constraint programming search algorithm that is designed for a
broad class of scheduling problems. Failure-directed Search (FDS) assumes that there is no …

Classical scheduling formulations typically assume static resource requirements and focus
on deciding when to start the problem activities, so as to optimize some performance metric …

We consider the 2D orthogonal feasibility problem (OPP-2) and the 2D strip packing
problem (SPP-2). Given a set of rectangular items, the OPP-2 is to decide whether all items …

This work is motivated by an industrial need of manufacturing façades insulating envelopes
in order to reduce energy consumption in residential buildings. An insulating envelope is a …

Facade-layout synthesis occurs when renovating buildings to improve their thermal
insulation and reduce the impact of heating on the environment. This interesting problem …

We consider the feasibility problem OPP (orthogonal packing problem) in higher-
dimensional orthogonal packing: given a set of d-dimensional (d≥ 2) rectangular items …

This thesis presents the application of several Constraint Programming (CP) techniques to
combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial …

La programmation par contraintes est une approche régulièrement utilisée pour résoudre
des problèmes combinatoires d'origines diverses. Dans cette thèse nous nous focalisons …

We consider the 3D orthogonal feasibility problem (OPP-3). Given a set of rectangular items,
OPP-3 is to decide whether all items can be orthogonally packed into the given rectangular …

This book constitutes the proceedings of the 12th International Conference on the
Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in …