We present the solution for the job shop scheduling problem, which originated in Cablex company in the wire-cutting process. For the purpose we developed a new heuristic algorithm, which bases on simulated annealing algorithm, where instead of exponential probability for uphill moves we introduced Heaviside's step function.