Revisit the scheduling problem with calibrations

DOI10.4230/LIPICS.ISAAC.2024.20MaRDI QIDQ7260632zbMATH OpenFDO

Authors Lin Chen, Yixiong Gao, Minming Li, Guohui Lin, Kai Wang

Publication date 8 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2024.20

zbMATH Keywords

approximation algorithmcalibrationresource augmentationscheduling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithms for Scheduling Independent Tasks
• Calibration scheduling with time slot cost
• Calibrations scheduling with arbitrary lengths and activation length
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Minimizing the cost of batch calibrations
• On the Complexity of Minimizing the Total Calibration Cost
• Online scheduling of time-critical tasks to minimize the number of calibrations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling algorithms
• Scheduling many types of calibrations
• Speed is as powerful as clairvoyance
• Weighted throughput maximization with calibrations
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: Revisit the scheduling problem with calibrations

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