Approximate Local Search Methods for Multi-objective Sequencing Problem

Abstract

In the setting of a single machine, this study suggests approximation localsearch strategies to identify approximate solutions to the multi-objective sequencing problem, where the problem is the total of the four objectives: total completion time ∑Cjj= 1,....,n, total lateness ∑Lj, maximum lateness Lmaxand maximum earliness Emax.Descent Method (DM), Simulated Annealing (SA), and genetic algorithm (GA) are three approximate local search techniques that are computer-implemented Matlab programs. On the basisof the outcomes of computing tests, conclusions are modeled on the effectiveness of the local search techniques