LAUSR

Multi-Period Service Scheduling Problem MSSP is descibed as a category of problems that arise in the context of scheduling services. In these problems, customers have a periodic service to be attended, a finite number of times, within the time horizon. The Multi-Period Multi-Service Scheduling Problem MMSSP is presented as an alternative formulation for MSSP, in which the resolution of an MMSSP is equivalent to the resolution of multiple MSSP, demonstrating the complexity of solving this pattern. The presented formulation can lead several applications in different areas. To solve this new pattern, the Relax-and-Fix and Fix-and-Optimize strategies are used. In these heuristics, part of the entire variables are fixed and/or relaxed interactively. To assess the efficiency of the strategies, a set of 150 small, medium and large instances are generated and resolved. The results of extensive experiments demonstrate that heuristics produce quality solutions, highlighting a good balance between optimization and computational time.