Minimizing the total completion times, the total tardiness and the maximum tardiness

الملخص EN

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine.

We proposed algorithms to solve the single machine scheduling multiobjective problem.

In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria.

First a branch and bound (BAB) algorithm is applied for the 1//ΣCi+ΣTi+Tmax problem.

Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(ΣCi ,ΣTi ,Tmax) problem.

The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of non dominated solutions.