Apparatus for scheduling and allocating radio resources, the apparatus comprising a processor configured to schedule a plurality of transmission flows into a plurality of groups according to a transmission request of at least one user equipment, UE, and according to interference information, allocate a transmission duration to each transmission flow, wherein transmission flows of the same group are allocated the same transmission duration, according to traffic demand information of the at least one UE, allocate a transmission power to each transmission flow, wherein for transmission flows of the same group the transmission powers are allocated according to a channel quality of each transmission flow of the group; characterized in that the processor is further configured to transmit up to a maximum number of transmission flows of the same group simultaneously and with the allocated transmission duration and powers; wherein for the scheduling of the transmission flows the processor is configured to find the maximum number of transmission flows for each group, which can be transmitted simultaneously without violating any Time Division Duplex, TDD, constraint, or half-duplex constraint, and without causing interference above a threshold value; wherein the group is a Spatial Division Multiple Access, SDMA, group including SDMA concurrent transmission flows; wherein for the finding of the maximum number of transmission flows for each group the processor is configured to generate a conflict graph according to the transmission request and the interference information, the conflict graph including nodes, which represent transmission flows, and edges, which represent TDD constraints, or half-duplex constraints, and interference above a threshold between two selected transmission flows, and find a maximum number of nodes in the conflict graph, for which no edges exist between any two selected nodes. schedule a plurality of transmission flows into a plurality of groups according to a transmission request of at least one user equipment, UE, and according to interference information, allocate a transmission duration to each transmission flow, wherein transmission flows of the same group are allocated the same transmission duration, according to traffic demand information of the at least one UE, allocate a transmission power to each transmission flow, wherein for transmission flows of the same group the transmission powers are allocated according to a channel quality of each transmission flow of the group; characterized in that the processor is further configured to transmit up to a maximum number of transmission flows of the same group simultaneously and with the allocated transmission duration and powers; wherein for the scheduling of the transmission flows the processor is configured to find the maximum number of transmission flows for each group, which can be transmitted simultaneously without violating any Time Division Duplex, TDD, constraint, or half-duplex constraint, and without causing interference above a threshold value; wherein the group is a Spatial Division Multiple Access, SDMA, group including SDMA concurrent transmission flows; find the maximum number of transmission flows for each group, which can be transmitted simultaneously without violating any Time Division Duplex, TDD, constraint, or half-duplex constraint, and without causing interference above a threshold value; wherein the group is a Spatial Division Multiple Access, SDMA, group including SDMA concurrent transmission flows; wherein for the finding of the maximum number of transmission flows for each group the processor is configured to generate a conflict graph according to the transmission request and the interference information, the conflict graph including nodes, which represent transmission flows, and edges, which represent TDD constraints, or half-duplex constraints, and interference above a threshold between two selected transmission flows, and find a maximum number of nodes in the conflict graph, for which no edges exist between any two selected nodes. generate a conflict graph according to the transmission request and the interference information, the conflict graph including nodes, which represent transmission flows, and edges, which represent TDD constraints, or half-duplex constraints, and interference above a threshold between two selected transmission flows, and find a maximum number of nodes in the conflict graph, for which no edges exist between any two selected nodes.