Scheduling with variable-length calibrations: two agreeable variants

DOI10.1016/J.TCS.2021.07.021MaRDI QIDQ2232596zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 6 October 2021

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

Full work available at URL https://doi.org/10.1016/j.tcs.2021.07.021

zbMATH Keywords

dynamic programmingcalibrationapproximation algorithmsscheduling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Scheduling many types of calibrations
• Calibration scheduling with time slot cost
• Calibration scheduling with time slot cost
• Minimizing the cost of batch calibrations
• Minimizing the cost of batch calibrations

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Calibration scheduling with time slot cost
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Minimizing the cost of batch calibrations
• On the Complexity of Minimizing the Total Calibration Cost
• Scheduling many types of calibrations
• Weighted throughput maximization with calibrations

Cited in

(5)

• Calibration scheduling with time slot cost
• Scheduling many types of calibrations
• Calibration scheduling with time slot cost
• Minimizing the cost of batch calibrations
• Calibrations scheduling with arbitrary lengths and activation length

This page was built for publication: Scheduling with variable-length calibrations: two agreeable variants

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