Tree and local search for parallel machine scheduling problems with precedence constraints and setup times
Résumé
We present a large neighborhood search method based on limited discrepancy search to solve a parallel machine scheduling problem with precedence constraints and sequence-dependent setup times. New dominance rules and filtering techniques are proposed. Considering both maximum lateness and sum of completion times minimization, our method compares favorably to previously proposed tree search-based methods on standard problems.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...