Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
From MaRDI portal
Publication:3902467
DOI10.1145/322234.322242zbMath0454.68016OpenAlexW2085298577MaRDI QIDQ3902467
Greg N. Frederickson, Peter J. Downey, John L. Bruno
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322234.322242
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Simple Strategies in Multi-Objective MDPs ⋮ Markov automata with multiple objectives ⋮ Time complexity of single machine scheduling with stochastic precedence constraints ⋮ Cost vs. time in stochastic games and Markov automata ⋮ Optimal sequences in stochastic single machine shops ⋮ A case for on-machine load balancing ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Approximation results in parallel machines stochastic scheduling ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ Minimizing expected makespans of multi-priority classes of jobs on uniform processors ⋮ A uniformization-based algorithm for continuous-time stochastic games model checking ⋮ Analysis of computer job control under uncertainty ⋮ Robust scheduling of parallel machines with sequence-dependent set-up costs ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ On index policies for stochastic minsum scheduling ⋮ Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines ⋮ Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
