This chapter presents an application of finite blocklength results for user scheduling in a multiple access channel. User scheduling is a typical problem in multiuser communication, especially for base stations or WIFI. The goal is to select users with good channel quality so that the overall performance is maximized. Under the quasi-static fading model, this chapter presents an attempt in user scheduling, where channel state information is either perfectly known or only known from its distribution. Scheduling algorithms for both cases are presented and numerically simulated to demonstrate its convergence and good performance. A take-home message is that low-complexity, well-designed scheduling algorithms can achieve close to optimal performance in terms of outage capacity and outage probability. The readers can learn about a demo application of finite blocklength information theoretical results to practical wireless communications problems.