Computing and Combinatorics

DOI10.1007/b99243zbMath1091.90502OpenAlexW2491887524MaRDI QIDQ4681179

Wun-Tat Chan, Prudence W. H. Wong, Tak-Wah Lam, Hing-Fung Ting

Publication date: 15 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99243

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (13)

Improved on-line broadcast scheduling with deadlines ⋮ Design and analysis of online batching systems ⋮ On-line production order scheduling with preemption penalties ⋮ Online scheduling of bounded length jobs to maximize throughput ⋮ Competitive analysis of most-request-first for scheduling broadcasts with start-up delay ⋮ Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs ⋮ A near optimal scheduler for on-demand data broadcasts ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ A note on on-line broadcast scheduling with deadlines ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ A tight lower bound for job scheduling with cancellation ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands

This page was built for publication: Computing and Combinatorics