The triangle scheduling problem

Christoph Dürr*, Zdeněk Hanzálek, Christian Konrad, Yasmina Seddik, R.A. Sitters, Óscar C. Vásquez, Gerhard Woeginger

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)305–312
Number of pages8
JournalJournal of Scheduling
Volume21
Issue number3
DOIs
Publication statusPublished - 2018

    Fingerprint

Keywords

  • Mixed-criticality
  • Packing
  • Scheduling

Cite this

Dürr, C., Hanzálek, Z., Konrad, C., Seddik, Y., Sitters, R. A., Vásquez, Ó. C., & Woeginger, G. (2018). The triangle scheduling problem. Journal of Scheduling, 21(3), 305–312. https://doi.org/10.1007/s10951-017-0533-1