Multicriteria approach to rank scheduling strategies

This paper deals with multicriteria decision-making applied to discrete-continuous scheduling problems. The need for reusability and modularity leads us to build a “generic” optimization and simulation framework, while the need to quickly generate good compromises between conflicting objectives requires the implementation of multicriteria scheduling models. This paper describes the practical possibilities of two hybrid models within this framework, the first one uses a lexicographical sort and the second one a multicriteria method to rank scheduling strategies. The two hybrids are applied to a real-life highly constrained industrial problem.