Approximation schemes for machine scheduling

DOI10.1007/978-3-031-08623-6_4MaRDI QIDQ6606622zbMATH OpenFDO

Authors Marten Maack

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-08623-6_4

zbMATH Keywords

approximationmakespanparallel machinesPTASscheduling

Mathematics Subject Classification ID

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

Recommendations

• Approximation schemes for scheduling on parallel machines
• Approximation schemes for robust makespan scheduling problems
• A PTAS for minimizing the total weighted completion time on identical parallel machines.
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
• scientific article; zbMATH DE number 4011924

Cites work

• Approximation algorithms for combinatorial problems
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• Approximation schemes for scheduling on parallel machines
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Empowering the configuration-IP -- new PTAS results for scheduling with setups times
• scientific article; zbMATH DE number 7650890 (Why is no real title available?)
• Scheduling parallel machines with inclusive processing set restrictions

Cited in

(2)

• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
• Load balancing: the long road from theory to practice

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606622)