Longest Happy String

Construct the longest possible string using up to a, b, and c occurrences of letters 'a', 'b', and 'c' such that it never contains "aaa", "bbb", or "ccc"; the core challenge is to schedule letters (favoring those with higher remaining counts) without creating three identical consecutive characters.