A Sort & Search Method For Multicriteria Optimization Problems With Applications To Scheduling Theory

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 NP-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.