Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time

DOI10.1007/S00453-023-01198-WMaRDI QIDQ6492085

Zhi-Zhong Chen, Mingyang Gong, Unnamed Author

Publication date: 24 April 2024

Published in: Algorithmica (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient update strategies for geometric computing with uncertainty
• Scheduling with testing on multiple identical parallel machines
• Scheduling with a processing time oracle
• Explorable uncertainty in scheduling with non-uniform testing times
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
• An adversarial model for scheduling with testing
• The update complexity of selection and related problems
• Computing the Median with Uncertainty
• Bounds for Certain Multiprocessing Anomalies
• Scheduling
• Improved approximation algorithms for multiprocessor scheduling with testing

This page was built for publication: Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time