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 …

This paper intends to address the distributed flexible job shop scheduling problem (DFJSP)
with minimizing maximum completion time (makespan). In order to solve this problem, we …

We study a real-life problem in which a nurse is required to check upon patients she is
responsible for either by home visits or phone calls. Due to the large number of patients and …

This paper presents constraint programming-based solution approaches for the three-
dimensional loading capacitated vehicle routing problem (3l-CVRP) that consists of vehicle …

This paper addresses the non-preemptive unrelated parallel machine scheduling problem
(PMSP) with job sequence and machine dependent setup times. This is a widely seen NP …

Repetitive projects are characterized by a set of activities that need to be repeated in several
units. Optimizing the work sequence between each activity in different units is essential to …

This study investigates the team orienteering problem with time windows and mandatory
visits (TOPTW-MV), a new variant of the well-known team orienteering problem with time …

The team orienteering problem with time windows (TOPTW) is a well-known variant of the
orienteering problem (OP) originated from the sports game of orienteering. Since the …

The team orienteering problem with time windows (TOPTW) is a highly constrained NP-hard
problem having many practical applications in vehicle routing and production scheduling …

Proper scheduling of jobs is essential for modern production systems to work effectively. The
hybrid flow shop scheduling problem is a scheduling problem with many applications in the …