In this paper, we consider a user scheduling problem which maximizes the weighted sum-rate (WSR) in multicell multiple input single output (MISO) downlink systems. Since an exhaustive search algorithm requires high computational complexity, we propose a low complexity algorithm which finds a user set in terms of WSR maximization. We first consider a greedy user selection algorithm which almost achieves the system performance of the exhaustive search algorithm in high SNR regime. Next, a distributed user scheduling algorithm is proposed by employing the maximized signal-to-leakage-and-noise ratio (SLNR) in the selection criteria. This leads to a reduction of the system overhead of exchanging channel state information and computational complexity. From simulation results, we show that the performance of our proposed scheme is very close to the conventional greedy user scheme with lower overhead.