On the complexity of minimizing the total calibration cost

Abstract : Bender et al. (SPAA 2013) proposed a theoretical framework for testing in contexts where safety mistakes must be avoided. Testing in such a context is made by machines that need to be often calibrated. Since calibrations have non negligible cost, it is important to study policies minimizing the calibration cost while performing all the necessary tests. We focus on the single-machine setting and we study the complexity status of different variants of the problem. First, we extend the model by considering that the jobs have arbitrary processing times and that the preemption of jobs is allowed. For this case, we propose an optimal polynomial time algorithm. Then, we study the case where there is many types of calibrations with different lengths and costs. We prove that the problem becomes NP-hard for arbitrary processing times even when the preemption of the jobs is allowed. Finally, we focus on the case of unit-time jobs and we show that a more general problem, where the recalibration of the machine is not instantaneous, can be solved in polynomial time.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01630651
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, November 7, 2017 - 9:30:24 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

Eric Angel, Evripidis Bampis, Vincent Chau. On the complexity of minimizing the total calibration cost. 11th International Frontiers of Algorithmics Workshop (FAW 2017), Jun 2017, Chengdu, China. pp.1--12, ⟨10.1007/978-3-319-59605-1_1⟩. ⟨hal-01630651⟩

Share

Metrics

Record views

408