International Scholarly Research Notices

Research Article

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

Table 4

(a) Case of 3 transporter vehicles with capacity equal to 2. (b) Case of 3 transporter vehicles with capacity equal to 3.
(a)
Instances 𝑛 𝑀 ACOJSP ACOJSP Gap (%)
( 𝑅 = 3 , Cap = 1)( 𝑅 = 3 , Cap = 2)
LT133 3 5 1 1 7 1 2 6 7 . 7
LT144 4 5 1 2 9 1 3 5 4 . 7
LT155 5 5 1 3 1 1 3 4 2 . 3
LT233 3 5 1 4 5 1 5 1 4 . 1
LT244 4 5 1 4 5 1 4 8 2 . 1
LT255 5 5 1 4 6 1 4 8 1 . 4
LT333 3 5 2 0 0 2 0 3 1 . 5
LT344 4 5 2 0 5 2 0 5 0 . 0
LT355 5 5 2 0 4 2 0 5 0 . 5
LT433 3 5 1 5 8 1 8 5 1 7 . 1
LT444 4 5 1 7 2 1 8 9 9 . 9
LT455 5 5 1 9 8 1 7 7 − 1 0 . 6
LT533 3 5 2 3 0 2 6 3 1 4 . 3
LT544 4 5 2 4 2 2 5 7 6 . 2
LT555 5 5 2 8 5 2 6 4 − 7 . 4
𝑅 : the number of transporter vehicles.
Cap: the capacity of transfer of a transporter vehicle.
Gap = [ ( 𝐵 2 − 𝐵 1 ) / 𝐵 1 ] ∗ 1 0 0 .
𝐵 1 : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 1.
𝐵 2 : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 2.
(b)
Instances 𝑛 𝑚 ACOJSP ACOJSP Gap (%)
( 𝑅 = 3 , Cap = 1)( 𝑅 = 3 , Cap = 3)
LT13335 3 5 1 1 7 1 2 6 7 . 7
LT14445 4 5 1 2 9 1 2 9 0 . 0
LT15555 5 5 1 3 1 1 5 7 1 9 . 8
LT23335 3 5 1 4 5 1 5 3 5 . 5
LT24445 4 5 1 4 5 1 4 8 2 . 1
LT25555 5 5 1 4 6 1 4 3 − 2 . 1
LT33335 3 5 2 0 0 2 0 0 0 . 0
LT34445 4 5 2 0 5 2 0 5 0 . 0
LT35555 5 5 2 0 4 2 0 3 − 0 . 5
LT43335 3 5 1 5 8 1 8 9 1 9 . 6
LT44445 4 5 1 7 2 1 9 4 1 2 . 8
LT45555 5 5 1 9 8 2 2 3 1 2 . 6
LT53335 3 5 2 3 0 2 5 2 9 . 6
LT54445 4 5 2 4 2 2 9 2 2 0 . 7
LT55555 5 5 2 8 5 2 6 8 − 6 . 0
Gap = [ ( 𝐵 2 − 𝐵 1 ) / 𝐵 1 ] ∗ 1 0 0 .
𝐵 1 : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 1.
𝐵 2 : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 3.