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

DOI10.1016/J.COR.2020.105093MaRDI QIDQ2664447zbMATH OpenOpenAlexFDO

Authors Moritz Buchem, T. Vredeveld

Publication date 20 April 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

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

Recommendations

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

Cites work

• A new algorithm for online uniform-machine scheduling to minimize the makespan
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Approximation in stochastic scheduling
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
• Bounds for List Schedules on Uniform Processors
• Fifty years of scheduling: a survey of milestones
• General parametric scheme for the online uniform machine scheduling problem with two different speeds
• Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• scientific article; zbMATH DE number 3748968 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• LP-based online scheduling: From single to parallel machines
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Scheduling Unrelated Machines by Randomized Rounding
• Scheduling with Random Service Times
• Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
• Stochastic online scheduling on unrelated machines
• Stochastic scheduling problems I — General strategies
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Unrelated machine scheduling with stochastic processing times
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

Cited in

(5)

• scientific article; zbMATH DE number 1757946 (Why is no real title available?)
• Restricted Adaptivity in Stochastic Scheduling
• Dynamic scheduling with uncertain job types
• Online early work scheduling on parallel machines
• Semi-online scheduling on two uniform parallel machines with initial lookahead

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

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