The response time is one of the most important performance measurements for information retrieval on networks. A shortest-job-first packet scheduling algorithm to reduce the average response time of interactive network applications is proposed in the paper. The analysis and simulation show that the proposed scheduling algorithm significantly reduces the average response time and has important practical value to improve the performance of interactive applications on WWW.