Scheduling with obligatory tests

DOI10.4230/LIPICS.ESA.2024.48MaRDI QIDQ7253105zbMATH OpenFDO

Authors Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.48

zbMATH Keywords

competitive ratioonline algorithmscheduling with testingsum of completion times

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• An adversarial model for scheduling with testing
• Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
• Explorable uncertainty in scheduling with non-uniform testing times
• Improved approximation algorithms for multiprocessor scheduling with testing
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
• Nonclairvoyant scheduling
• Scheduling with testing on multiple identical parallel machines
• The power of amortization on scheduling with explorable uncertainty

Cited in

(1)

• Scheduling on identical machines with setup time and unknown execution time

This page was built for publication: Scheduling with obligatory tests

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