  Cellular networks provide communication for different applications. Some
applications have strict and very short latency requirements, while others
require high bandwidth with varying priorities. The challenge of satisfying the
requirements grows in congested traffic where some packets might miss their
deadlines. Unfortunately, we prove that the problem is NP-Hard. To overcome
this, we propose a new scheduling policy for packets with multiple priorities,
latency requirements, and strict deadlines. To alleviate the complexity, our
solution incorporates a novel time domain relaxation solved by linear
programming. Simulation results show that this method outperforms existing
scheduling strategies.
