Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Algorithm 1

Neighborhood search simulated annealing algorithm.

(1)	Choose a gene at random.
(2)	If the selected gene is located in the first location of the chromosome, then replace it with the next gene.
	Otherwise,
(3)	If the selected gene is located at the last location of the chromosome replace it with the previous gene.
	Otherwise,
(6)	Evaluate exchanging with the two lateral genes (previous and next).
(7)	Replace the selected gene with the lateral gene that gets the most improvement.
(8)	End of condition.