A Robust Two-Machine Flow-Shop Scheduling Model with Scenario-Dependent Processing Times

Algorithm 1

The details of 12 variants of CSA.

	Input: 12 initials of and values of parameters , λ,
	(1) Do i = 1, 12
	(2) for each
	(3) Let T = Ti
	(4) Do while {T > }
	(5) Let He = T, En = T, u0 = 1 − T, ,
	where 0 < q < 1, and 0 <  < .
	(6) Let
	(7) Do while { j < Nr}.
	(8) Choose p and q integers randomly with
	(9) Interchange the p^th position and q^th position in to generate another new schedule .
	(10) Compute the value of the objective function for , obj ().
	(11) If obj() < obj(), then replace by ; otherwise, replace by if < , where is a random number between (0, 1) and .
	(12) j = j + 1
	(13) End do
	(14)
	(15) End do
	(16) Output the final schedule ,
	(17) End do
	(18) Output the final 12 schedules