Toward a Global Constraint for Minimizing the Flowtime - Groupe Recherche Opérationnelle de Grenoble Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Toward a Global Constraint for Minimizing the Flowtime

Vers une Contrainte Globale pour Minimiser le Délai Moyen

Résumé

This work is a study toward a global constraint minimizing the flowtime of a single machine scheduling problem. Classical methods for filtering algorithms use a lower bound coming from the solution of a relaxation. Notably, there are several polynomial relaxations to minimize the flowtime on a single machine. A general scheme for the global constraint is proposed that allows the use of a subset of polynomial relaxations that lays the ground for more complex filtering algorithms. The filtering algorithm has a complexity of O(n ·M· R), where n is the number of tasks, M is an upper bound on the time windows of these tasks, and R is the complexity of the algorithm used for solving the relaxation. The constraint has been tested on both single machine and flowshop problems. Experimental results show that the performance improvement depends on the type of problem. The number of branches reduction is promising for designing new filtering rules.
Fichier sous embargo
Fichier sous embargo
Fichier sous embargo
0 2 24
Année Mois Jours
Avant la publication
lundi 23 septembre 2024
Fichier sous embargo
0 2 24
Année Mois Jours
Avant la publication
lundi 23 septembre 2024
Fichier sous embargo
lundi 23 septembre 2024
Connectez-vous pour demander l'accès au fichier

Dates et versions

hal-04604138 , version 1 (06-06-2024)

Licence

Identifiants

Citer

Camille Bonnin, Arnaud Malapert, Margaux Nattaf, Marie-Laure Espinouse. Toward a Global Constraint for Minimizing the Flowtime. 13th International Conference on Operations Research and Enterprise Systems, SCITEVENTS, Feb 2024, Rome, Italy. pp.70-81, ⟨10.5220/0012310200003639⟩. ⟨hal-04604138⟩
3 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More