 |
Heuristics approaches for solving a bilevel parallel machine scheduling problem
1 : Laboratoire d'Informatique Fondamentale et Appliquée de Tours
Université de Tours, Institut National des Sciences Appliquées - Centre Val de Loire
2 : Politecnico di Torino, DIGEP
In this study, three heuristics are proposed to solve a bilevel scheduling problem with a twofold objective: developing efficient methods to tackle large instances and finding better solutions on particularly challenging instances, surpassing the performance of exact algorithms.
