The competitiveness of on-line assignments
Journal of Algorithms
Scheduling Parallel Machines On-line
SIAM Journal on Computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
Approximation schemes for constrained scheduling problems
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Operations Research Letters
Hi-index | 0.00 |
This paper is concerned with a scheduling problem that occurs in service systems where customers are classified as `ordinary' and `special'. Ordinary customers can be served on any service facility, while special customers can be served only on the flexible service facilities. Customers arrive dynamically over time and their needs become known upon arrival. We assume any service, once started, will be carried out to its completion. In this paper, we study the worst-case performance of service policies used in practice. In particular, we evaluate three classes of service policies: policies with priority, policies without priority, and their combinations. We obtain tight worst-case performance bounds for all service policies considered.