The goal of this paper is to develop models and methods that use complementary strengths
of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques …

Parallel machine flexible resource scheduling (PMFRS) problems consider an additional
flexible resource (eg operators), which can be freely allocated to any jobs and/or any …

Following from part I, which presents a retrospective on optimization, we focus here on areas
that are recent active research topics and are likely to strongly influence the future of …

This paper is aimed at researchers and practitioners in Operational Research who are
interested in the new field of Constraint Programming/Constraint Logic Programming. Due to …

Because of their complementary strengths, optimization and constraint programming can be
profitably merged. Their integration has been the subject of increasing commercial and …

A flexible job-shop scheduling problem (FJSP) with parallel batch processing machines
(PBM) is addressed. First, we exhibit an enhanced mixed integer programming (MIP) model …

A resource-constrained identical parallel machine scheduling problem with machine
eligibility restrictions is investigated in this study. For the considered problem, three …

This paper describes a number of key modeling issues for the development of tools for
solving nonlinear discrete/continuous problems where logic/disjunctive constraints are …

Constraint programming (CP) methods exhibit several parallels with branch-and-cut
methods for mixed integer programming (MIP). Both generate a branching tree. Both use …

В статье представлен обзор основных направлений удовлетворения ограничений (УО)
и программирования в ограничениях. Целью задачи УО является нахождение значений …