  In this work, we investigate the sum-rate performance of multicell and
cell-free massive MIMO systems using linear precoding and multiuser scheduling
algorithms. We consider the use of a network-centric clustering approach to
reduce the computational complexity of the techniques applied to the cell-free
system. We then develop a greedy algorithm that considers multiple candidates
for the subset of users to be scheduled and that approaches the performance of
the optimal exhaustive search. We assess the proposed and existing scheduling
algorithms in both multicell and cell-free networks with the same coverage
area. Numerical results illustrate the sum-rate performance of the proposed
scheduling algorithm against existing approaches.
