Colored-independence in Graphs

I will present a storage/scheduling problem which, in addition to the standard restriction involving pairs of elements that cannot be placed together, considers pairs of elements that must be placed together. A set S is a colored-independent set if, for each color class V_i, S \cap V_i = V_i or S \cap V_i = \emptyset. Various results for the coupled-independence number and the independence-partition number will be presented. The talk will conclude with a brief discussion of the complexity of the resulting decision problems.