Problem 1882 · Medium

Process Tasks Using Servers

Assign each arriving task to a free server, preferring the lowest weight and then the lowest index, and queue tasks when all servers are busy. The visual shows idle and busy servers as two pools with tasks moving between them along a timeline.

Open the interactive visualisation