Scheduling jobs on identical and uniform processors revisited

DOI10.1007/978-3-642-29116-6_10MaRDI QIDQ2896383zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bin packingEPTASscheduling on uniform processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

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

Cited in

(16)

• Tightness of sensitivity and proximity bounds for integer linear programs
• An efficient PTAS for parallel machine scheduling with capacity constraints
• Scheduling identical jobs on uniform parallel machines under position-based learning effects
• An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
• scientific article; zbMATH DE number 5964914 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1530325 (Why is no real title available?)
• A PTAS for scheduling unrelated machines of few different types
• scientific article; zbMATH DE number 6007890 (Why is no real title available?)
• Closing the gap for makespan scheduling via sparsification techniques
• Empowering the configuration-IP: new PTAS results for scheduling with setup times
• 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)