Weighted interval set scheduling problem
Sure, you can define any problem you want.  Effectively you would no longer seek a cover of intervals, but a cover of sets, where each set is a union of intervals.  Over a discrete set, any set can be expressed as a union of intervals.  Thus, this is equivalent to the maximum set packing problem.  Consequently, it is NP-hard.