Optimal allocation of arrivals to a collection of parallel workstations

Presents a model that minimizes an aggregate measure of waiting times and queue lengths for a collection of workstations. Shows that the naïve allocation of arrivals among workstations in proportion to their processing times does not result in an optimized system. Uses the Lagrange multiplier in determining the proportional distribution rate that minimizes waiting times and queue lengths in a collection of workstations. Finally, shows the effectiveness of this model through analytical methods and computer simulation applied to a series of sample cases and an application problem.