Efficient algorithms for scheduling parallel jobs with interval constraints in clouds

DOI10.1007/978-3-030-92681-6_16OpenAlexW4205622433MaRDI QIDQ2149869

Longkun Guo, Xuanming Xu

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_16

zbMATH Keywords

optimalityparallel processingintegral polyhedronmachine minimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Online machine minimization with lookahead
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
• An improved algorithm for online machine minimization
• Two-Processor Scheduling with Start-Times and Deadlines
• Some simple scheduling algorithms
• An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization
• Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for scheduling parallel jobs with interval constraints in clouds