The power of migration for online slack scheduling

DOI10.4230/LIPICS.ESA.2016.75zbMATH Open1397.90192OpenAlexW2534143023MaRDI QIDQ4606349FDOQ4606349

Authors: Chris Schwiegelshohn, Uwe Schwiegelshohn 

Publication date: 2 March 2018

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2016/6416/

Recommendations

• Online scheduling with bounded migration
• Automata, Languages and Programming
• On the value of job migration in online makespan minimization
• On the value of job migration in online makespan minimization
• Online scheduling with migration on two hierarchical machines

zbMATH Keywords

competitive analysisonline schedulingdeadlinespreemption with migration

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Scheduling Periodic Tasks with Slack
• Online interval scheduling to maximize total satisfaction
• Optimally Handling Commitment Issues in Online Throughput Maximization
• A general framework for handling commitment in online throughput maximization
• Online Throughput Maximization on Unrelated Machines: Commitment is No Burden

This page was built for publication: The power of migration for online slack scheduling

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