Similar Posts

Subscribe
Notify of
1 Answer
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
PWolff
PWolff
1 year ago

Imagine a distribution point for mail packages.

Once a day, a large load train with N packages arrives. These packets are to be forwarded to N receivers or to an individual receiver. A small electric vehicle is available for this, which can always transport only a single package and needs a certain time to go. (Here breaks the image – a purely electronic transmission does not need a card that has to be returned; the vehicle would have to travel back indefinitely.)

L corresponds to the size of the small van and R of its speed.

From this you can calculate how long a single package is on the go and how long this is, for example, 15. Package must wait for its delivery.

From this it is possible to calculate how long it takes until the bearing is empty again.

We only trust the outgoing Connection, it only depends on the departure times. The first package can in principle be reloaded directly from the load train to the delivery trolley (or we neglect the charging times – which is also done in the case of the digital packages). The last package only waits (N-1) round-trip times for its departure, because only (N-1) packages are in progress.

(When we look at the arrival times, everything shifts backwards by a round trip. The last package arrives N roundabout times after arrival of the train at the final recipient.)

1