An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints

Résumé

We study here the problem of scheduling unit-time jobs with release and due dates on identical machines while meeting a non-idling constraint and minimizing the number of active machines. Though this problem is theoretically solvable in polynomial time, designing an efficient algorithm remains an issue. We establish here several theoretical results that allow us to break symmetries and significantly reduce the search space, before designing and testing a very efficient A∗ like algorithm involving constraint propagation, which outperforms standard approaches based upon ILP formulations.
Fichier non déposé

Dates et versions

hal-04611116 , version 1 (13-06-2024)

Identifiants

Citer

Philippe Chretienne, Alain Quilliot, Hélène Toussaint. An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints. 9th International Conference on Control, Decision and Information Technologies (CoDIT), Jul 2023, Rome, Italy. pp.136-141, ⟨10.1109/CODIT58514.2023.10284420⟩. ⟨hal-04611116⟩
4 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More