Define these dispatching rules for transporters with equations.

$$First come first served $($by requests$)-$

$$First encountered first served $-$

$$Largest queue size $($sending station$)-$

$$Smallest queue size $($receiving station$)-$

$$Random workstation $-$

$$Priority based on job priority $-$

$$Longest distance transporter $-$

$$Shortest distance transporter $-$

$$Nearest vehicle idle $-$

$$Random $-$

$$Shortest queue $-$