Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines

DOI10.1016/j.cor.2020.105093zbMath1458.90386OpenAlexW3083844065MaRDI QIDQ2664447

Moritz Buchem, Tjark Vredeveld

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105093

zbMATH Keywords

parallel machine schedulingstochastic online scheduling policiesuniform related machines

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Dynamic scheduling with uncertain job types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• A new algorithm for online uniform-machine scheduling to minimize the makespan
• LP-based online scheduling: From single to parallel machines
• General parametric scheme for the online uniform machine scheduling problem with two different speeds
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
• Stochastic online scheduling on unrelated machines
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Approximation in stochastic scheduling
• Unrelated Machine Scheduling with Stochastic Processing Times
• Stochastic scheduling problems I — General strategies
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• Fifty years of scheduling: a survey of milestones
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Bounds for List Schedules on Uniform Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Scheduling independent tasks to reduce mean finishing time
• Scheduling Unrelated Machines by Randomized Rounding
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
• Models and Algorithms for Stochastic Online Scheduling
• Scheduling with Random Service Times

This page was built for publication: Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines