Graph Coloring · Superchallenge problem

Eight people form $4$ couples. Every two people who are NOT a couple must hold one meeting, and each person can attend at most one meeting per time slot. What is the fewest time slots needed? (This is the chromatic index of the cocktail party graph $K_{2,2,2,2}$.)