The triangle scheduling problem - Sorbonne Université Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2017

The triangle scheduling problem

Résumé

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to optimality when the binary tree ratio of the input instance is at most 2. We also show that the problem is unary NP-hard for instances with binary tree ratio strictly larger than 2 and provide a quasi-polynomial time approximation scheme. The approximation ratio of Greedy on general instances is shown to be between 1.5 and 1.05.

Dates et versions

hal-01524866 , version 1 (19-05-2017)

Identifiants

Citer

Christoph Dürr, Zdenek Hanzalek, Christian Konrad, Yasmina Seddik, René Sitters, et al.. The triangle scheduling problem. Journal of Scheduling, 2017, ⟨10.1007/s10951-017-0533-1⟩. ⟨hal-01524866⟩
121 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More