%0 Journal Article
%T Solving multi-objectives function problem using branch and bound and local search methods
%J International Journal of Nonlinear Analysis and Applications
%I Semnan University
%Z 2008-6822
%A Ibrahim, Manal Hashim
%A Ali, Faez Hassan
%A Chachan, Hanan Ali
%D 2022
%\ 03/01/2022
%V 13
%N 1
%P 1649-1658
%! Solving multi-objectives function problem using branch and bound and local search methods
%K Machine Scheduling with Multi-Objective problem
%K Branch and Bound
%K Simulated Annealing
%K Genetic Algorithm. Optimization
%K Firefly Algorithm
%R 10.22075/ijnaa.2022.5780
%X In this paper we consider $1//\sum^n_{j=1}{(E_j+T_j+C_j+U_j+V_j)}$ 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.
%U https://ijnaa.semnan.ac.ir/article_5780_3f21f94cf3d643f8862c0e7e9704c901.pdf