Scheduling many types of calibrations

DOI10.1007/978-3-030-57602-8_26MaRDI QIDQ2039673zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 5 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57602-8_26

zbMATH Keywords

approximation algorithmscalibrationscheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling with variable-length calibrations: two agreeable variants
• Minimizing the cost of batch calibrations
• Calibration scheduling with time slot cost
• Calibration scheduling with time slot cost
• Minimizing the cost of batch calibrations

Cites work

• Calibration scheduling with time slot cost
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Random forests
• Scheduling unit tasks to minimize the number of idle periods
• Stochastic gradient boosting.
• The elements of statistical learning. Data mining, inference, and prediction
• Weighted throughput maximization with calibrations

Cited in

(8)

• Calibrations scheduling with arbitrary lengths and activation length
• Calibration scheduling with time slot cost
• Scheduling with variable-length calibrations: two agreeable variants
• Weighted throughput maximization with calibrations
• On the Complexity of Minimizing the Total Calibration Cost
• Minimizing the cost of batch calibrations
• Calibration scheduling with time slot cost
• Revisit the scheduling problem with calibrations

This page was built for publication: Scheduling many types of calibrations

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