Approximation schemes for multiprocessor scheduling within budget

DOI10.1016/J.TCS.2026.116194MaRDI QIDQ7363116zbMATH OpenFDO

Authors Mingyang Gong, Randy Goebel, Guohui Lin, Bing Su

Publication date 29 September 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116194

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A survey of scheduling with controllable processing times
• A survey on offline scheduling with rejection
• A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
• Algorithms for communication scheduling in data gathering network with data compression
• An adversarial model for scheduling with testing
• Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
• Approximation schemes for scheduling on parallel machines
• Bounds for Certain Multiprocessing Anomalies
• Closing the gap for makespan scheduling via sparsification techniques
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
• Multiprocessor Scheduling with Rejection
• On the optimality of approximation schemes for the classical scheduling problem
• Scheduling with a limited testing budget: tight results for the offline and oblivious settings
• Scheduling with explorable uncertainty

This page was built for publication: Approximation schemes for multiprocessor scheduling within budget

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