Reordering buffer management with advice

DOI10.1007/s10951-016-0487-8zbMath1391.90232DBLPjournals/scheduling/AdamaszekRRS17OpenAlexW2440062056WikidataQ58203646 ScholiaQ58203646MaRDI QIDQ1707821

Marc P. Renault, Anna Adamaszek, Adi Rosén, Rob van Stee

Publication date: 4 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10951-016-0487-8

zbMATH Keywords

competitive analysisonline algorithmsonline algorithms with advicereordering buffer management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Almost Tight Bounds for Reordering Buffer Management

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on sorting buffers offline
• NP-hardness of the sorting buffer problem on the uniform metric
• Online algorithms with advice for bin packing and scheduling problems
• Online computation with advice
• The string guessing problem as a method to prove lower bounds on the advice complexity
• On online algorithms with advice for the \(k\)-server problem
• Online makespan minimization with parallel schedules
• On the Advice Complexity of the k-Server Problem
• A sequential ordering problem in automotive paint shops
• Information Complexity of Online Problems
• On the Advice Complexity of Online Problems
• On the Advice Complexity of Buffer Management
• Online Makespan Scheduling with Sublinear Advice
• Advice Complexity and Barely Random Algorithms
• Almost tight bounds for reordering buffer management
• How Much Information about the Future Is Needed?
• Automata, Languages and Programming
• A Constant Factor Approximation Algorithm for Reordering Buffer Management

This page was built for publication: Reordering buffer management with advice