ALGORITHMS FOR THE MULTIPERIOD WORKFORCE SCHEDULING AND ROUTING PROBLEM WITH DEPENDENT TASKS
Workforce Scheduling and Routing. Flexible Job Shop. Vehicle Routing Problem. Multiperiod. Logistics. Heuristics.
Logistics problems lie at the core of industries’ everyday operations. These types of problems are also one of the main points of interest of the Operations Research field of study, where in recent years, Workforce Scheduling and Routing Problems (WSRP) have gained significant attention from researchers. In this document a new WSRP is studied: in the Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks (MWRSPDT) a given company provides services by means of mobile teams. Service requests are known beforehand and each service is composed of one or more activities, where each activity may depend on another. A feasible schedule must be provided for these teams where all requested activities are completed in the minimum amount of days, while respecting the existing dependencies. Two heuristic approaches based on a Mixed-Integer Programming formulation are proposed.