报告简介：The scheduling problem with calibrations was introduced by Bender et al. (SPAA 2013). In sensitive applications, machines need to be periodically calibrated to ensure that they run correctly. Formally, we are given a set of n jobs with release times, deadlines and weights. Calibrating a machine requires a cost and remains calibrated for a period of T time units, after which it must be recalibrated before it can resume running jobs. Moreover, we are given a budget of K calibrations. The objective is to schedule a set of jobs such that the total weight is maximized on m identical machines with at most K calibrations.
报告人简介：Vincent Chau于2014年获得法国埃夫里大学计算机系博士学位，之后分别在香港城市大学及香港浸会大学做博士后。2017年在中国科学院深圳先进技术研究院做博士后，2019年起任助理研究员。2021年起在东南大学计算机科学与工程学院任副教授。研究领域包括：算法设计与分析、能源调度优化、校准调度等。 近年来累计以第一作者、通讯作者身份在国际著名期刊 Theoretical Computer Science、Journal of Combinatorial Optimization、Journal of Scheduling 以及 SPAA、STACS、ISAAC 等计算理论知名国际学术会议上发表论文二十余篇。
