Approximation schemes for machine scheduling

DOI10.1007/978-3-031-08623-6_4zbMATH Open1547.9009MaRDI QIDQ6606622FDOQ6606622

Authors: Marten Maack 

Publication date: 17 September 2024

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

zbMATH Keywords

approximationschedulingmakespanparallel machinesPTAS

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for combinatorial problems
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• Scheduling parallel machines with inclusive processing set restrictions
• Title not available (Why is that?)
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• Title not available (Why is that?)

Cited In (2)

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

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)