Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models...

A well-known theorem of graph theory gives a simple formula for the calculation of the number of spanning trees of a complete graph with n labeled vertices. A well-known proof of this theorem uses a combinatorial identity, related to Abel's generalization of the binomial theorem, that is...