Speed-robust scheduling: sand, bricks, and rocks

DOI10.1007/s10107-022-01829-0OpenAlexW4283775538MaRDI QIDQ2689830

Kevin Schewior, Ruben Hoeksma, Lukas Nölke, Nicole Megow, Bertrand Simon, Franziska Eberle

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01829-0

zbMATH Keywords

robustschedulingresource allocationmakespanunknown processing speed

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)

Uses Software

• MapReduce

Cites Work

• Approximation schemes for scheduling on parallel machines
• Robust discrete optimization and its applications
• An adversarial model for scheduling with testing
• Optimal algorithms for scheduling under time-of-use tariffs
• Online makespan minimization with parallel schedules
• Universal Sequencing on an Unreliable Machine
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Scheduling When You Do Not Know the Number of Machines
• Scheduling Real-Time Mixed-Criticality Jobs
• An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
• Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
• Scheduling
• Scheduling with unexpected machine breakdowns

This page was built for publication: Speed-robust scheduling: sand, bricks, and rocks