Generalized disjunctive constraint propagation for solving the job shop problem with time lags
Résumé
In this paper we propose new insights based on an insertion heuristic and generalized resource constraint propagation for solving the job shop scheduling problem with minimum and maximum time-lags. To show the contribution of our propositions we propose a branch-and-bound algorithm and provide an experimental study. The results obtained conclude that our heuristic obtains feasible schedules with a better makespan than previous approaches, especially for instances with tightened time lags. The results also prove the interest of the constraint propagation generalization when time lags are considered.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...