Speed-robust scheduling. Sand, bricks, and rocks

DOI10.1007/978-3-030-73879-2_20zbMath1483.90052arXiv2011.05181OpenAlexW3172550999MaRDI QIDQ2061889

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

Publication date: 21 December 2021

Full work available at URL: https://arxiv.org/abs/2011.05181

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Approximation schemes for scheduling on parallel machines
• Robust discrete optimization and its applications
• An adversarial model for scheduling with testing
• Online makespan minimization with parallel schedules
• Universal Sequencing on an Unreliable Machine
• Dual Techniques for Scheduling on a Machine with Varying Speed
• 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
• Bounds for Certain Multiprocessing Anomalies
• Scheduling with unexpected machine breakdowns

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