Back to Search
Start Over
A Sort & Search method for multicriteria optimization problems with applications to scheduling theory.
- Source :
- Journal of Multi-Criteria Decision Analysis; Jan-Apr2019, Vol. 26 Issue 1/2, p84-90, 7p, 2 Diagrams, 2 Charts
- Publication Year :
- 2019
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10579214
- Volume :
- 26
- Issue :
- 1/2
- Database :
- Complementary Index
- Journal :
- Journal of Multi-Criteria Decision Analysis
- Publication Type :
- Academic Journal
- Accession number :
- 135144162
- Full Text :
- https://doi.org/10.1002/mcda.1660