The algorithm assigns each volunteer to exactly one slot (the end time of a range), prioritizing volunteers with the fewest available slots, and then balancing load by choosing the slot with the fewest assignments so far.