scientific article; zbMATH DE number 4011924

MaRDI QIDQ3761689zbMATH OpenFDO

Authors Dorit S. Hochbaum, David B. Shmoys

Publication date 1986

zbMATH Keywords

dual approximation approachfamily of polynomial-time algorithmsminimum makespan problempolynomial approximation schemeschedulinguniform parallel processors

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Approximation Algorithms For Scheduling On Uniform Processors
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• scientific article; zbMATH DE number 1405790
• Approximation schemes for scheduling on parallel machines

Cited in

(8)

• Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
• An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors
• Polynomial time approximation schemes for general multiprocessor job shop scheduling
• Tight FPT approximation for socially fair clustering
• Approximation schemes for machine scheduling
• A modification of Hochbaum and Shmoys' algorithm for scheduling problems

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 Q3761689)