Abstract: Modern heuristic techniques that have wide application area since 1990s, aim at achieving the near optimal with their own specific local search systems. These solutions do not guarantee the optimal solution but represent sufficient and significant results for the cases. One of the modern heuristic techniques that called “simulated annealing” is covered by this study. The study also includes a sample case of a sequencing problem of flow shop system for which a simulated annealing algorithm is presented. In addition, the results obtained from the simulated annealing algorithm are compared with the results of scheduling software LEKIN for the same problem. Finally, a simulated annealing algorithm is obtained which is very close to the results of LEKIN which is broadly used within the scheduling applications according to the objective under consideration. Keywords: simulated annealing, sequencing, flow shop scheduling, LEKIN