This paper considers the scheduling problem that minimizes the average response time of two jobs subject to window constraints. By window constraints, we mean that within a fixed time interval, the server can serve at mostW packets from one job, where W is called the window size of the job. This paper investigates the effects of the window constraints in detail, and derives the optimal policy. ...