Please use this identifier to cite or link to this item:
Title: Minimizing the cost of batch calibrations
Author(s): Zhao, Yingchao 
Author(s): Chau, V.
Li, M.
Wang, E. Y.
Zhang, R.
Issue Date: 2020
Publisher: Elsevier
Journal: Theoretical Computer Science 
Volume: 828-829
Start page: 55
End page: 64
We study the scheduling problem with calibrations. We are given a set of n jobs that need to be scheduled on a set of m machines. However, a machine can schedule jobs only if a calibration has been performed beforehand and the machine is considered as valid during a fixed time period of T, after which it must be recalibrated before running more jobs. In this paper, we investigate the batch calibrations; calibrations occur in batch and at the same moment. It is then not possible to perform any calibrations during a period of T. We consider different cost function depending on the number of machines we calibrate at a given time, i.e., the cost function is denoted as f(x) where x is the number of calibrations in the batch. Moreover, jobs have release time, deadline, and unit processing time. The objective is to schedule all jobs with the minimum cost of calibrations. We give a dynamic program to solve the case with an arbitrary cost function. Then, we propose several faster approximation algorithms for different cost functions: an optimal algorithm when f(x) = b, a 3-approximation algorithm when f(x) = x and a (m+b) / (b+1) -approximation algorithm when f(x) = x + b. The running time of these algorithms are O(n2) .
DOI: 10.1016/j.tcs.2020.04.020
CIHE Affiliated Publication: Yes
Appears in Collections:CIS Publication

SFX Query Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.