I would like to seek some modeling advice on the following:
Say for instance I have 5 nodes representing workstations of the operation of 5 jobs, and that I have less than 5 vehicles. Say I have two vehicles.
It is obvious that only 2 workstations will be serviced at the beginning while the rest will have to wait till either of the 2 have finished processing.
Hence, say for instance, vehicles have been assigned to visit stations 1 and 2, with the start time of each station being the distance traveled, and that both vehicles depart from the depot at time 0.
The difficulty resides in finding the minimum of the 2 completion times, so that the earliest of the remaining 3 stations to be served is approximated by setting it to be greater than or equal to that of the minimal completion times of both said stations.