General Packet Radio Service (GPRS) provides mobile users end-to-end packet-switched services by sharing the radio channels with voice and circuit-switched services. In such a system, radio resource allocation for circuit-switched and packet-switched services is an important issue, which may affect the QoS for both services significantly. In this paper, we propose two algorithms: Dynamic Resour...

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

In this paper, we present scheduling algorithms that simultaneously support guaranteed starting times and favor jobs with systemdesired traits. To achieve the first of these goals, our algorithms keep a profile with potential starting times for every unfinished job and never move these starting times later, just as in Conservative Backfilling. To achieve the second, they exploit previously unre...