I have roughly 10 employees assigned a random cost (for this example, lets say $0-$500). I'm trying to optimize grouping the employees into 3 groups. Every employee in the group must be paid the same amount, the highest cost of the employee in that group. There is no requirement for how many employees in each group.
Example table;
| Employee | Cost |
|---|---|
| 1 | 120 |
| 2 | 10 |
| 3 | 400 |
| 4 | 0 |
| 5 | 0 |
| 6 | 420 |
| 7 | 80 |
| 8 | 180 |
| 9 | 270 |
| 10 | 410 |
Example Non-Optimized Solution)
Group 1 Employees 4, 5, 2 (Cost 30 based on employee 2 costing $10)
Group 2 Employees 7, 1 (Cost 240 based on employee 1 costing $120)
Group 3 Employees 8, 9, 3, 10, 6 (Cost 2100 based on employee 6 costing $420)
Total Cost = $2,370
Any advice on how to break down this problem greatly appreciated!
This question has nothing whatsoever to do with group theory, which is a branch of abstract mathematics dealing with symmetries, transformations, and such.
Anyway, the way to visualize your problem is as follows:
You search through the two "splitting positions" to minimize the combined area of the three colored rectangles (total cost).
I wonder if the following pseudo-greedy algorithm is optimal: