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 (%)
(, Cap = 1)
(, Cap = 2)
LT133
LT144
LT155
LT233
LT244
LT255
LT333
LT344
LT355
LT433
LT444
LT455
LT533
LT544
LT555
: the number of transporter vehicles. Cap: the capacity of transfer of a transporter vehicle. Gap = . : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 1. : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 2.
(b)
Instances
ACOJSP
ACOJSP
Gap (%)
(, Cap = 1)
(, Cap = 3)
LT13335
3
5
LT14445
4
5
LT15555
5
5
LT23335
3
5
LT24445
4
5
LT25555
5
5
LT33335
3
5
LT34445
4
5
LT35555
5
5
LT43335
3
5
LT44445
4
5
LT45555
5
5
LT53335
3
5
LT54445
4
5
LT55555
5
5
Gap = . : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 1. : The solution found by ACOJSP in the case of 3 transporter vehicles, capacity 3.