NP-completeness of the Active Time Scheduling Problem

TL;DR

This paper proves that the active time scheduling problem, which involves scheduling jobs with release times and deadlines on a machine with limited simultaneous capacity to minimize active slots, is NP-complete.

Contribution

The paper establishes the NP-completeness of the active time scheduling problem, resolving a long-standing open question in the field.

Findings

Proves NP-completeness of the active time scheduling problem.

Clarifies the computational complexity of energy-efficient scheduling.

Provides a foundation for future approximation algorithms.

Abstract

In this paper, we study the active time scheduling problem. We are given n jobs with integral processing times each of which has an integral release time and deadline. The goal is to schedule all the jobs on a machine that can work on b jobs simultaneously, and the objective is to minimize the number of time slots for which the machine is active. The active time scheduling model was introduced by Chang et al. in the context of energy-efficient scheduling. Surprisingly, despite the development of a number of constant factor approximation algorithms for the problem, the complexity of this fundamental problem had remained open. In this paper, we resolve this open problem and show that the active time scheduling problem is indeed NP-complete.