Scheduling jobs on identical and uniform processors revisited
DOI10.1007/978-3-642-29116-6_10zbMATH Open1242.68036OpenAlexW1447903712MaRDI QIDQ2896383FDOQ2896383
Authors: Christina Robenek, Klaus Jansen 
Publication date: 16 July 2012
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_10
Recommendations
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Closing the gap for makespan scheduling via sparsification techniques
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cited In (15)
- Tightness of sensitivity and proximity bounds for integer linear programs
- An efficient PTAS for parallel machine scheduling with capacity constraints
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- Title not available (Why is that?)
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Scheduling imprecise computation tasks on uniform processors
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- A PTAS for scheduling unrelated machines of few different types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Closing the gap for makespan scheduling via sparsification techniques
- EPTAS for parallel identical machine scheduling with time restrictions
This page was built for publication: Scheduling jobs on identical and uniform processors revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896383)
