The vehicle routing problem
We consider regenerative processes with values in some general Polish space. We define their -big excursions as excursions such that , where is some given functional on the space of excursions which can be thought of as, e.g., the length or the height of . We establish a general condition that guarantees the convergence of a sequence of regenerative processes involving the convergence of -big excursions and of their endpoints, for all in a set whose closure contains . Finally, we provide...
In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most K tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of...