On-line service scheduling
type: Item
instance of: scholarly article
title: On-line service scheduling
zbMATH Open document ID: 1168.90476
author: Bo Chen
author: Zhenbo Wang
author: Wenxun Xing
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5599877
zbMATH Keywords: competitive ratio
zbMATH Keywords: on-line
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: service policy evaluation
MaRDI profile type: Publication
full work available at URL: s10951-008-0075-7
OpenAlex ID: W2168963756
cites work: On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling
cites work: The Competitiveness of On-Line Assignments
cites work: Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
cites work: Q4247460
cites work: Algorithms for Scheduling Tasks on Unrelated Processors
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
cites work: Scheduling Parallel Machines On-Line
cites work: Worst-case analysis for on-line service policies
DOI: 10.1007/S10951-008-0075-7
description: scientific article; zbMATH DE number 5599877