Delay at a congested service facility, such as a waterway lock, depends on
the control policy used. The shortest processing time first (SPF) policy, w
hich is a promising priority control policy, can significantly reduce the a
verage delay/barge compared to the normally used first come first served (F
CFS) policy. SPF tends to favor large groups of barges, i.e., tows, at the
expense of smaller ones. This paper modifies the SPF policy to consider fai
rness among tows in queues. One modified algorithm, called fairer SPF (FSPF
), limits the number of tows allowed to pass any particular tow. The case s
tudy indicates that FSPF can yield most of the benefits of SPF without grea
tly sacrificing fairness. Compared with FCFS, FSPF can reduce barge delay u
p to 53.89%. When tow sizes land thus service times) are similar, the benef
its from resequencing tows are limited. Results confirm that larger tow siz
e variance yields larger barge-delay savings. The barge-delay savings for F
SPF compared to FCFS range from 6.68% for constant tow size to 60.74% in a
high-variance case. The results indicate that significant delay reductions
are achievable without significantly compromising fairness.