We examine the problem of scheduling jobs on machines to minimize multiple conflictuous criteria. This problem is considered in the context of Multicriteria Optimization Theory. After having introduced the foundations, we define Multicriteria Scheduling Problems (MSP) and we present a framework for solving them. We review the literature on MSP, providing both complexity results and comments on recent advances.
CITATION STYLE
T’Kindt, V., & Billaut, J.-C. (2006). Multicriteria Scheduling Problems. In Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys (pp. 445–491). Kluwer Academic Publishers. https://doi.org/10.1007/0-306-48107-3_9
Mendeley helps you to discover research relevant for your work.