Date: prev next · Thread: first prev next last
2016 Archives by date, by thread · List index

On 22-08-16 20:16, Brian Barker wrote:

At 16:37 22/08/2016 +0200, Wiebe van der Worp wrote:
There is a group of ~100 people (n). In 5 time slots they visit 5
rooms in groups of ~20 people (n/5). The composition of the groups
should be as different as possible for each time slot. One person may
not visit a room more than once.

Here's an idea:


This will ensure that each person visits each room exactly once, but the
groups sizes will vary from exactly n/5. You could use COUNTIF() to list
the sizes of the twenty-five groups and determine the range of sizes
using MIN() and MAX(). Then you could use Recalculate Hard
(Ctrl+Shift+F9) repeatedly to regenerate the random numbers until you
were happy with the group sizes.

Your solution is way more elegant than mine and I will put these control measures at work, thanks. On the other hand, the deviation of number of people per room is quite unexpected, forcing a lot of Ctrl-Shift-F9 strokes.

This problem may be of the sort that would be much easier to solve
through programming that via a spreadsheet.

As Dave Liesse confirmed, driving in nails with the flat side of an axe. But it works for one time usage ;-)

Thanks to everyone for helping.

To unsubscribe e-mail to:
Posting guidelines + more:
List archive:
All messages sent to this list will be publicly archived and cannot be deleted


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.