On the Complexity of Minimizing the Total Calibration Cost

DOI10.1007/978-3-319-59605-1_1zbMath1494.68029OpenAlexW2618005576MaRDI QIDQ4632198

Vincent Chau, Eric Angel, Evripidis Bampis, Vassilios Zissimopoulos

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (6)

Online scheduling of time-critical tasks to minimize the number of calibrations ⋮ Calibration scheduling with time slot cost ⋮ Scheduling with variable-length calibrations: two agreeable variants ⋮ Scheduling many types of calibrations ⋮ Minimizing the cost of batch calibrations ⋮ Calibrations scheduling with arbitrary lengths and activation length

Cites Work

• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Speed is as powerful as clairvoyance
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: On the Complexity of Minimizing the Total Calibration Cost