Scheduling many types of calibrations

DOI10.1007/978-3-030-57602-8_26zbMath1483.90050OpenAlexW3048332924MaRDI QIDQ2039673

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

schedulingcalibrationapproximation algorithms

Mathematics Subject Classification ID

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

Related Items (2)

Scheduling with variable-length calibrations: two agreeable variants ⋮ Calibrations scheduling with arbitrary lengths and activation length

Cites Work

• Unnamed Item
• Cost-efficient scheduling on machines from the cloud
• Calibration scheduling with time slot cost
• Weighted throughput maximization with calibrations
• Scheduling unit tasks to minimize the number of idle periods
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Complexity of Minimizing the Total Calibration Cost
• Minimizing the cost of batch calibrations
• The elements of statistical learning. Data mining, inference, and prediction
• Random forests
• Stochastic gradient boosting.

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