A Sort & Search method for multicriteria optimization problems with applications to scheduling theory

Lei Shang (1, 2) , Vincent t'Kindt (1, 2)

1 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
2 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002

This paper focuses on the Sort & Search method to solve a particular class of single criterion optimization problems called multiple constraints problems. This general method enables to derive exponential-time algorithms for urn:x-wiley:mcda:media:mcda1660:mcda1660-math-0001-hard optimization problems. In this paper, this method is further extended to the class of multicriteria multiple constraints problems for which the set of Pareto optima is enumerated. Then, the application of this new method on some multicriteria scheduling problems is proposed, leading to new exponential-time algorithms for those problems.

Mots clés: Multicriteria optimization; Exponential-time algorithms; Scheduling; Sort & Search

Domaines: Recherche opérationnelle [math.OC]

Lei Shang, Vincent t'Kindt. A Sort & Search method for multicriteria optimization problems with applications to scheduling theory. Journal of Multi-Criteria Decision Analysis, 2019, 26 (1-2), pp.84-90. ⟨10.1002/mcda.1660⟩. ⟨hal-03001038⟩