The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times

Table 1

Summary of the instances structure.

Group						Identification
1	5	3-4-5-6-7	U(1, 4)	U(1, 10)	U(10^2, 10^3)	5−− 4− 1
	10	6-8-10-12-14	U(1, 9)	U(1, 10)	U(10^2, 10^3)	10− − 9−1
	20	12-16-20-24-28	U(1, 19)	U(1, 10)	U(10^2, 10^3)	20− −19−1
	40	24-32-40-48-56	U(1, 39)	U(1, 10)	U(10^2, 10^3)	40− −39−1
	60	36-48-60-72-84	U(1, 59)	U(1, 10)	U(10^2, 10^3)	60−−59−1
2	5	3-4-5-6-7	U(1, 4)	U(10, 10^2)	U(10^3, 5000)	5−−4−2
	10	6-8-10-12-14	U(1, 9)	U(10, 10^2)	U(10^3, 5000)	10−−9−2
	20	12-16-20-24-28	U(1, 19)	U(10, 10^2)	U(10^3, 5000)	20−−19−2
	40	24-32-40-48-56	U(1, 39)	U(10, 10^2)	U(10^3, 5000)	40−−39−2
	60	36-48-60-72-84	U(1, 59)	U(10, 10^2)	U(10^3, 5000)	60−−59−2