On-line service scheduling

DOI10.1007/S10951-008-0075-7zbMath1168.90476OpenAlexW2168963756MaRDI QIDQ835637

Bo Chen, Wen-Xun Xing, Zhen-bo Wang

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-008-0075-7

zbMATH Keywords

competitive ratioparallel machine schedulingon-lineservice policy evaluation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Makespan minimization in online scheduling with machine eligibility ⋮ Makespan minimization in online scheduling with machine eligibility

Cites Work

• Unnamed Item
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Worst-case analysis for on-line service policies
• Algorithms for Scheduling Tasks on Unrelated Processors
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Scheduling Parallel Machines On-Line
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: On-line service scheduling