Algorithms for multicriteria scheduling problems

Abstract EN

In this paper, we consider the multicriteria scheduling problem on single machine to minimize two criteria: maximum cost function, denoted by maximum late work (Vmax) and maximum earliness (Emax).

We propose several algorithms based on types of objectives function to be optimized.

The solutions of the proposed procedures are compared with that of the optimal solutions and Pareto optimal solutions for the smaller instance size, these algorithms dealing with hierarchical minimization problem as well as simultaneous minimization problem with and without weight.

Computational results show the usefulness of these procedures.