Online scheduling with partial job values: does timesharing or randomization help?
From MaRDI portal
Publication:1879362
DOI10.1007/s00453-003-1025-6zbMath1087.68519OpenAlexW1991173480MaRDI QIDQ1879362
Francis Y. L. Chin, Stanley P. Y. Fung
Publication date: 22 September 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/48425
Related Items
Improved competitive algorithms for online scheduling with partial job values ⋮ A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Adaptive online scheduling of tasks with anytime property on heterogeneous resources ⋮ Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints ⋮ Non-preemptive buffer management for latency sensitive packets ⋮ Randomized two-valued bounded delay online buffer management ⋮ A comprehensive study of an online packet scheduling algorithm ⋮ Bounded delay packet scheduling in a bounded buffer ⋮ Online packet scheduling with bounded delay and lookahead ⋮ The loss of serving in the dark ⋮ Collecting weighted items from a dynamic queue ⋮ Preemptive scheduling in overloaded systems. ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Online competitive algorithms for maximizing weighted throughput of unit jobs ⋮ Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ Comparison-based buffer management in QoS switches ⋮ Improved randomized online scheduling of intervals and jobs ⋮ Buffer management for colored packets with deadlines ⋮ A universal randomized packet scheduling algorithm ⋮ Randomized competitive algorithms for online buffer management in the adaptive adversary model ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Randomized Algorithms for Buffer Management with 2-Bounded Delay ⋮ Prompt Mechanisms for Online Auctions ⋮ ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead ⋮ Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the dynamic maintenance of maximal points in the plane
- On the competitiveness of on-line real-time task scheduling
- An almost optimal algorithm for unbounded searching
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Dynamic TCP acknowledgement and other stories about e/(e-1)
