Open AccessPerformance enhancement of numerical approaches for scheduling problem on machine single
Author(s) -
Omar Selt
Publication year - 2021
Publication title -
independent journal of management and production
Language(s) - English
Resource type - Journals
ISSN - 2236-269X
DOI - 10.14807/ijmp.v12i7.1029
Subject(s) - tabu search , computer science , heuristics , metaheuristic , mathematical optimization , single machine scheduling , scheduling (production processes) , job shop scheduling , algorithm , mathematics , schedule , operating system
In this paper, we consider a single-machine scheduling problem, with the aim of minimizing the weighted sum of the completion time. This problem is NP-hard, making the search for an optimal solution very difficult. In this frame, two heuristics (H1), (H2) and metaheuristic tabu search are suggested.To improve the performance of this techniques, we used, on one hand, different diversification strategies (TES1 and TES2) with the aim of exploring unvisited regions of the solution space. On the other hand, we suggested three types of neighborhoods (neighborhood by swapping, neighborhood by insertion and neighborhood by blocks).It must be noted that tasks movement can be within one period or between different periods.