Multicriteria Scheduling Problems

  • T’Kindt V
  • Billaut J
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free