solving multi-objectives function problem using branch and bound and local search methods

In this paper we consider 1//∑n j=1 (ej + tj + cj + uj + vj ) problem, the discussed problem is called a multi objectives function (mof) problem, as objective is to find a sequence that minimizes the multiple objective functions, the sum earliness, the tardiness, the completion time, the number of late jobs and the late work. the np-hard nature of the problem, hence the existence of a polynomial time method for finding an optimal solution is unlikely. this complexity result leads us to use an enumeration solution approach. in this paper we propose a branch and bound method to solve this problem. also, we use fast local search methods yielding near optimal solution. we report on computation experience; the performances of exact and local search methods are tested on large class of test problems.