Increasing speed scheduling and flow scheduling

DOI10.1007/978-3-642-17514-5_24MaRDI QIDQ3060781zbMATH OpenOpenAlexFDO

Authors Sebastian Stiller, Andreas Wiese

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://depositonce.tu-berlin.de/handle/11303/15698

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Scheduling jobs that arrive over time
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

Cited in

(4)

• Dual techniques for scheduling on a machine with varying speed
• Moving to higher directional scheduling schemes
• On Submodular Search and Machine Scheduling
• Robust Appointment Scheduling with Heterogeneous Costs

This page was built for publication: Increasing speed scheduling and flow scheduling

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