Preemptive online algorithms for scheduling

DOI10.15960/J.CNKI.ISSN.1007-6093.2017.04.007MaRDI QIDQ3176073zbMATH OpenFDO

Authors Chao Ding

Publication date 18 July 2018

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2017.04.007

zbMATH Keywords

matrix optimizationmetric subregularityperturbation analysisrobustly isolated calmness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Spectral operators of matrices
• Stability analysis in optimization problems on matroids in the metric l₁
• scientific article; zbMATH DE number 1502618
• The matrix multidisk problem
• Robust algorithms for preemptive scheduling

Cited in

(5)

• Nearly on line scheduling of preemptive independent tasks
• Online scheduling FIFO policies with admission and push-out
• Online Linear Optimization for Job Scheduling Under Precedence Constraints
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
• On robust online scheduling algorithms

This page was built for publication: Preemptive online algorithms for scheduling

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