What type of problem would this question fall under, are there known algorithms/heuristics for it, what would be good resources to learn more about solving it?
- a list of items each with a destination location: the number of items per destination is unbounded (and can be zero for some locations). All items are at a central location.
- a number of destination locations, each awaiting a set number of the items: the number of locations is finite, and small [under a thousand]
- a number of couriers, all at the same point initially (the same initial location as the items); each courier has a maximum number of items they can carry: the number of couriers is very small [a dozen]
- the duration of travel between all locations [all couriers travel at the same speed]
Problem: minimize the maximum wait time of each location [the time it takes for all the items due at that location to be delivered] by allocating items to couriers.