首先描述了GPRS(GeneralPacketRadioService)中的服务质量标准和延迟的标准化方法 ,然后根据对GPRS特性的分析 ,得出了GPRS中分组调度算法应遵循的一些原则。根据这些原则确定了几种可能适合于GPRS的分组调度算法 ,并在此基础上提出了一种基于延迟约束的分组调度算法。通过仿真发现 ,新算法可在满足延迟要求的基础上以较小的复杂度获得比其余算法更高的资源利用率。 First of all, the quality of service (QoS) standard and delay standardization method in GPRS (General Packet Radio Service) are described. Based on the analysis of GPRS characteristics, some principles that should be followed in the packet scheduling algorithm in GPRS are derived. Based on these principles, we determine several packet scheduling algorithms that may be suitable for GPRS, and propose a packet scheduling algorithm based on delay constraints. It is found through simulation that the new algorithm can achieve higher resource utilization than other algorithms with less complexity on the basis of meeting the delay requirements.