Um novo método iterativo exato para o problema das sequências justas ponderadas

Abstract

This work addresses the Weighted Fair Sequences Problem (WFSP), a recently introduced optimization problem that belongs to the class of fair sequence problems. It encompasses a wide range of applications across different fields, varying from cost minimization in an automobile assembly line to the sequencing of maintenance services for factory machines. The WFSP is a periodic scheduling problem with a finite time horizon, where, given a set of activities with different priorities, the goal is to produce a sequence of executions such that the maximum product, defined as the product of the largest temporal distance between two consecutive executions of the same task and its priority, is minimized. This work proposes enhancements that strengthen the classical mathematical formulation of the WFSP, as well as an iterative algorithm based on recent advances in the literature. The computational experiments conducted demonstrate that the proposed iterative method finds more optimal solutions in less computational time compared to the state-of-the-art exact approach.