Restricted Adaptivity in Stochastic Scheduling

DOI10.4230/LIPICS.ESA.2021.79MaRDI QIDQ6075977zbMATH OpenOpenAlexFDO

Authors Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt

Publication date 20 September 2023

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

zbMATH Keywords

approximation algorithmfixed assignment policymakespan minimzationnon-anticipatory policystochastic scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Abstract: We consider the stochastic scheduling problem of minimizing the expected makespan on $m$ parallel identical machines. While the (adaptive) list scheduling policy achieves an approximation ratio of $2$, any (non-adaptive) fixed assignment policy has performance guarantee $Omegaleft(fraclogmloglogmight)$. Although the performance of the latter class of policies are worse, there are applications in which non-adaptive policies are desired. In this work, we introduce the two classes of $delta$-delay and $au$-shift policies whose degree of adaptivity can be controlled by a parameter. We present a policy - belonging to both classes - which is an $mathcalO(loglogm)$-approximation for reasonably bounded parameters. In other words, an exponential improvement on the performance of any fixed assignment policy can be achieved when allowing a small degree of adaptivity. Moreover, we provide a matching lower bound for any $delta$-delay and $au$-shift policy when both parameters, respectively, are in the order of the expected makespan of an optimal non-anticipatory policy.

Recommendations

• An improved greedy algorithm for stochastic online scheduling on unrelated machines
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
• Approximation and Online Algorithms
• On index policies for stochastic minsum scheduling
• A tight 2-approximation for preemptive stochastic scheduling

Cited in

(6)

• The price of fixed assignments in stochastic extensible bin packing
• On the Value of Adaptive Solutions to Stochastic Scheduling Problems
• Configuration balancing for stochastic requests
• Improved bounds for stochastic extensible bin packing under distributional assumptions
• Surgery scheduling in flexible operating rooms by using a convex surrogate model of second-stage costs
• Configuration balancing for stochastic requests

This page was built for publication: Restricted Adaptivity in Stochastic Scheduling

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