Two models for a service planning problem

The service planning problem is motivated by a situation faced by a telecommunications company where the following problem arises: how to select a subset of service orders to be performed by a set of available crews as well as determine the sequences in which they must be carried out such that the wage between the crews is balanced, taking into account restrictions on compatibility service-crew and working hours.

After a detailed literature review, we conclude that the problem can be modeled as a mixed-integer linear programming model and as a constraint programming model. The formulations are coded in C++ and solved through the CPLEX optimizer. In this work, we analyzed results over a set of 100 instances adapted from the literature.