Research Article

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

Table 1

Case of a single transporter vehicle.

Instances 𝑛 𝑚 LB UB Lacomme solution ACOJST DEV (%)

LT133 3 5 1 7 8 1 9 0 1 7 8 1 9 2 7 . 8
LT144 4 5 2 1 4 2 2 4 2 1 4 2 3 3 8 , 8
LT155 5 5 2 4 8 2 7 2 2 5 4 2 7 1 9 . 2
LT233 3 5 1 4 8 1 4 8 1 4 8 1 4 8 0
LT244 4 5 1 6 0 1 6 4 1 6 0 1 6 7 4 . 3
LT255 5 5 1 6 9 1 7 5 1 6 9 1 7 0 0 . 5
LT333 3 5 1 9 9 2 1 1 1 9 9 2 0 9 5
LT344 4 5 2 0 5 2 1 6 2 0 5 2 1 3 3 . 9
LT355 5 5 2 1 0 2 2 7 2 1 0 2 1 8 3 . 8
LT433 3 5 2 7 1 3 2 4 2 7 1 3 5 0 2 9 . 1
LT444 4 5 3 5 3 4 1 8 3 5 3 4 3 1 2 2
LT455 5 5 4 2 6 5 2 0 4 3 1 5 0 1 1 7 . 6
LT533 3 5 3 6 5 4 7 4 3 6 5 5 1 6 4 1 . 3
LT544 4 5 4 7 7 6 1 2 4 7 7 6 2 9 3 1 . 8
LT555 5 5 5 8 5 6 5 0 5 8 5 7 3 1 2 4 . 9

DEV: deviation of the solution given by ACOJST from LB.