Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Algorithm 2

Steps of the primary simulated annealing algorithm.

(1)	Generate a random permutation of operations.
(2)	Calculate the value of the objective function.
(3)	Set the parameters .
(4)	Check the termination condition, then go to step 5 if not met and go to step 15 if met.
(5)	Set .
(6)	go to step 7, otherwise, go to step 14.
(7)	Call the neighborhood search process.
(8)	If the value of the objective function is improved, go to step 9; otherwise go to step 10.
(9)	Accept the new solution, update the value of the objective function, and go to step 13.
(10)	Select a random number in (0, 1) and put it in .
(11)	If go to step 12; otherwise, go to step 13.
(12)	Accept the new solution, and update the value of the objective function.
(13)	Set .
(14)	Modify the new temperature as and go to step 4.
(15)	End.