Minimizing maximum flow time on related machines via dynamic posted pricing

DOI10.4230/LIPICS.ESA.2017.51MaRDI QIDQ5111740zbMATH OpenOpenAlexFDO

Authors Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein

Publication date 27 May 2020

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/7828/pdf/LIPIcs-ESA-2017-51.pdf/

zbMATH Keywords

online schedulingrelated machinesmaximum flow timecompetitiveness analysisposted pricing scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing maximum flow-time on related machines
• Minimizing Maximum Flow-time on Related Machines
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• Pricing online decisions: beyond auctions
• Minimizing maximum (weighted) flow-time on related and unrelated machines

Cites work

• Algorithmic Game Theory
• Algorithmic mechanism design (extended abstract)
• Automata, Languages and Programming
• Coordination mechanisms for selfish scheduling
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Minimizing maximum flow-time on related machines
• On-Line Load Balancing of Temporary Tasks
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Pricing online decisions: beyond auctions

Cited in

(5)

• A poly-log competitive posted-price algorithm for online metrical matching on a spider
• An \(O(\log n)\)-competitive posted-price algorithm for online matching on the line
• scientific article; zbMATH DE number 7378697 (Why is no real title available?)
• Pricing online decisions: beyond auctions
• Dynamic pricing of servers on trees

This page was built for publication: Minimizing maximum flow time on related machines via dynamic posted pricing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111740)