@inproceedings{4f9adbbe0f1c4e3ebe78469dee8b00b7,
title = "Nested Active-Time Scheduling",
abstract = "The active-time scheduling problem considers the problem of scheduling preemptible jobs with windows (release times and deadlines) on a parallel machine that can schedule up to g jobs during each timestep. The goal in the active-time problem is to minimize the number of active steps, i.e., timesteps in which at least one job is scheduled. In this way, the active time models parallel scheduling when there is a fixed cost for turning the machine on at each discrete step. This paper presents a 9/5-approximation algorithm for a special case of the active-time scheduling problem in which job windows are laminar (nested). This result improves on the previous best 2-approximation for the general case.",
keywords = "Active time, Approximation algorithm, Scheduling algorithms",
author = "Nairen Cao and Fineman, \{Jeremy T.\} and Shi Li and Juli{\'a}n Mestre and Katina Russell and Umboh, \{Seeun William\}",
note = "Publisher Copyright: {\textcopyright} Nairen Cao, Jeremy T. Fineman, Shi Li, Juli{\'a}n Mestre, Katina Russell, and Seeun William Umboh.; 33rd International Symposium on Algorithms and Computation, ISAAC 2022 ; Conference date: 19-12-2022 Through 21-12-2022",
year = "2022",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2022.36",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Bae, \{Sang Won\} and Heejin Park",
booktitle = "33rd International Symposium on Algorithms and Computation, ISAAC 2022",
}