The simulated annealing algorithm is known as a good metaheuristic in the area of permutation flowshop scheduling. In this work, modified simulated annealing algorithms are proposed and applied flowshop with makespan objective. The newly developed algorithms utilize candidate generation mechanisms in simulated annealing processsuch as an exchange method, a forward insertion method, and a backward insertion method. The simulation experiments are conducted to evaluate the effectiveness of proposed candidate mechanisms and results are reported.