An efficient implementation of a VNS heuristic for the weighted fair sequences problem

In the weighted fair sequences problem (WFSP), one aims to schedule a set of tasks or activities sthat the maximum product between the largest temporal distance between two consecutive executions of a task and its priority is minimized. The WFSP covers a large number of applications in different are...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International transactions in operational research 2024-05, Vol.31 (3), p.1720-1735
Hauptverfasser:	Rocha, Caroline, Pessoa, Bruno J.S., Aloise, Daniel, Cabral, Lucidio A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Assembly lines Computing time fair sequences Heuristic methods heuristics Iterative methods metaheuristics Operations research Scheduling Task scheduling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!