scientific article; zbMATH DE number 6677416

DOI10.4230/LIPICS.STACS.2015.474MaRDI QIDQ2955017zbMATH OpenFDO

Authors Sungjin Im, Benjamin Moseley, Kirk Pruhs

Publication date 24 January 2017

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2015.474

zbMATH Keywords

approximationcompletion timestochastic scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
• scientific article; zbMATH DE number 1061797
• Dynamic scheduling of stochastic jobs on a single machine
• Scheduling stochastic jobs with due dates on parallel machines
• Scheduling jobs with stochastic processing times and due dates to minimize total tardiness
• On the scheduling of alternative stochastic jobs on a single machine

Cited in

(12)

• Multi-objective stochastic scheduling of job ready times
• On index policies for stochastic minsum scheduling
• Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
• Increasing workload in a stochastic environment
• Stochastic load balancing on unrelated machines
• Stochastic load balancing on unrelated machines
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• Scheduling on a stochastic number of machines
• Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
• Configuration balancing for stochastic requests
• Stochastic load balancing with machine reservations
• Job scheduling and management of wearing tools with stochastic tool lifetimes

This page was built for publication:

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