A Novel Approach for Scheduling Problems on Machine Single

Abstract

In this paper, we will present a comparative study between two neighborhoods for solving scheduling problems on machine single to minimize the weighted sum of the task's end dates; since this problem is NP-hard in the strong sense, exact methods require a computational effort that increases exponentially with the size of the problem.

Approximate methods allow this problem to be solved reasonably.

 In this paper, we present the tabu search metaheuristic; it aims to find an approximate approach to the problem under consideration.

We present the tabu search method and detail the parameters and main steps of the proposed approach, and the results obtained are applicable in economics and industry.