An entropy approach to queueing control

The problems of scheduling and routing of customers in queueing systems are examined from the point of view of entropy which is a measure of uncertainty in the context of the random experiment at hand. Two principles are developed, one of the maximum rate of entropy reduction which is equivalent to maximum speed of order in the system and one of minimum entropy which is equivalent to minimum uncertainty. The resulting controls are straightforward and easy to apply.