International Scholarly Research Notices

Research Article

Ant Colony Algorithm for Just-in-Time Job Shop Scheduling with Transportation Times and Multirobots

Table 3

Case of a set of transporter vehicles.
Instances 𝑛 𝑚 LBLacomme solution ACOJSP ACOJSP ACOJSP
( 𝑅 = 1 ) ( 𝑅 = 1 ) ( 𝑅 = 1 ) ( 𝑅 = 4 )
LT133 3 5 1 7 8 1 7 8 1 3 0 1 1 7 1 1 7
LT144 4 5 2 1 4 2 1 4 1 4 0 1 2 9 1 3 2
LT155 5 5 2 4 8 2 5 4 1 4 7 1 3 1 1 2 5
LT233 3 5 1 4 8 1 4 8 1 4 4 1 4 5 1 4 5
LT244 4 5 1 6 0 1 6 0 1 4 2 1 4 5 1 4 5
LT255 5 5 1 6 9 1 6 9 1 4 9 1 4 6 1 4 6
LT333 3 5 1 9 9 1 9 9 2 0 0 2 0 0 2 1 2
LT344 4 5 2 0 5 2 0 5 2 0 5 2 0 5 2 0 5
LT355 5 5 2 1 0 2 1 0 2 0 4 2 0 4 2 0 4
LT433 3 5 2 7 1 2 7 1 2 0 3 1 5 8 1 4 4
LT444 4 5 3 5 3 3 5 3 2 5 0 1 7 2 1 5 9
LT455 5 5 4 2 6 4 3 1 2 6 4 1 9 8 1 7 3
LT533 3 5 3 6 5 3 6 5 2 9 3 2 3 0 1 9 8
LT544 4 5 4 7 7 4 7 7 3 6 3 2 4 2 2 3 1
LT555 5 5 5 8 5 5 8 5 3 7 4 2 8 5 2 2 3
𝑅 : the number of transporter vehicles.