The halting problem is one of the most important Turing’s discoveries. It is a decision problem and it consists of reporting whether a given program
with some input data would stop or run forever. This problem was proved by Turing to be
. This means that the relevant algorithm to solve this problem doesn’t exist. In this paper, we will show the application of this problem when the program
is a meta-heuristic technique and the input data is a decision scheduling problem. Further, we will also describe an efficient technique to solve the halting problem in this application case.