A Metaheuristic Algorithm to Transporter Scheduling for Assembly Blocks in a Shipyard considering Precedence and Cooperating Constraints

Table 2

Preprocessed block transportation tasks.

Task ID	Block ID	Weight (t)	Retrieve Place	Destination Place	Release Time (min)	Due Time (min)	Priority Task	Synchronous Task
1	B1	250	P1	P3	0	120	-	-
2	B2’	225	P2	P3	30	150	-	7
3	B3	300	P3	P4	100	250	-	-
4	B4	200	P1	P2	0	120	1	-
5	B5	200	P3	P2	100	250	3	-
6	B6	350	P2	P3	0	180	-	-
7	B2’	225	P2	P3	30	150	-	2