Approximation schemes for machine scheduling

DOI10.1007/978-3-031-08623-6_4zbMath1547.9009MaRDI QIDQ6606622

Marten Maack

Publication date: 17 September 2024

zbMATH Keywords

schedulingparallel machinesapproximationmakespanPTAS

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation algorithms for combinatorial problems
• Approximation schemes for scheduling on parallel machines
• Structural parameters for scheduling with assignment restrictions
• Scheduling parallel machines with inclusive processing set restrictions
• Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• An EPTAS for scheduling on unrelated machines of few different types

This page was built for publication: Approximation schemes for machine scheduling