Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing

DOI10.4230/LIPICS.ESA.2017.51zbMATH Open1442.90075OpenAlexW2760080258MaRDI QIDQ5111740FDOQ5111740

Kirk Pruhs, Sungjin Im, Clifford Stein, Benjamin Moseley

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)

Cites Work

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

Cited In (4)

• An \(O(\log n)\)-competitive posted-price algorithm for online matching on the line
• A poly-log competitive posted-price algorithm for online metrical matching on a spider
• Title not available (Why is that?)
• 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)