Stochastic Online Scheduling Revisited

DOI10.1007/978-3-540-85097-7_42MaRDI QIDQ5505682zbMATH OpenOpenAlexFDO

Authors Andreas S. Schulz

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_42

Mathematics Subject Classification ID

Approximation algorithms (68W25) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Approximation and Online Algorithms
• Stochastic online scheduling on unrelated machines
• Models and Algorithms for Stochastic Online Scheduling
• Approximation in Preemptive Stochastic Online Scheduling
• An improved greedy algorithm for stochastic online scheduling on unrelated machines

Cites work

• scientific article; zbMATH DE number 4152425 (Why is no real title available?)
• scientific article; zbMATH DE number 3755721 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• Approximation in Preemptive Stochastic Online Scheduling
• Approximation in stochastic scheduling
• Approximation results in parallel machines stochastic scheduling
• Approximation techniques for average completion time scheduling
• LP-Based Online Scheduling: From Single to Parallel Machines
• Models and Algorithms for Stochastic Online Scheduling
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• On-line scheduling to minimize average completion time revisited.
• Scheduling Unrelated Machines by Randomized Rounding
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
• Scheduling with Random Service Times
• Single machine scheduling with release dates
• Stochastic Machine Scheduling with Precedence Constraints
• Stochastic scheduling problems I — General strategies
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• The power of \(\alpha\)-points in preemptive single machine scheduling.

Cited in

(28)

• Unrelated machine scheduling with stochastic processing times
• Online scheduling for outpatient services with heterogeneous patients and physicians
• Online interval scheduling: Randomized and multiprocessor cases
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
• Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
• Approximation in stochastic scheduling
• Approximation and Online Algorithms
• An improved greedy algorithm for stochastic online scheduling on unrelated machines
• Online Scheduling via Learned Weights
• Comparing deterministic, robust and online scheduling using entropy
• A tight 2-approximation for preemptive stochastic scheduling
• Randomized selection algorithm for online stochastic unrelated machines scheduling
• LP-based online scheduling: From single to parallel machines
• Models and Algorithms for Stochastic Online Scheduling
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• Online scheduling on multiple resources under stochastic conditions
• Online stochastic reservation systems
• Opportunistic Scheduling as Restless Bandits
• Dual representation and its online scheduling method for event-varying DESs with capacity constraints
• OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
• Approximation in Preemptive Stochastic Online Scheduling
• Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
• On robust online scheduling algorithms
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• Dynamic resource allocation to improve emergency department efficiency in real time
• On index policies for stochastic minsum scheduling
• Stochastic online scheduling on unrelated machines
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models

This page was built for publication: Stochastic Online Scheduling Revisited

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