The triangle scheduling problem

  • Christoph Dürr
  • Zdeněk Hanzálek
  • Christian Konrad
  • Yasmina Seddik
  • René Sitters
  • Óscar C. Vásquez
  • Gerhard Woeginger
Article

DOI: 10.1007/s10951-017-0533-1

Cite this article as:
Dürr, C., Hanzálek, Z., Konrad, C. et al. J Sched (2017). doi:10.1007/s10951-017-0533-1
  • 31 Downloads

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.

Keywords

Scheduling Mixed-criticality Packing 

Funding information

Funder NameGrant NumberFunding Note
PHC van Gogh
  • 33669TC
Fondecyt
  • 11140566
Agence Nationale de la Recherche
  • ANR-15-CE40-0015
Icelandic Centre for Research
  • 120032011
  • 152679-051
European Regional Development Fund
  • CZ.02.1.01/0.0/0.0/15_003/0000466

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.UPMC Univ Paris 06, CNRS, LIP6Sorbonne UniversitésParisFrance
  2. 2.FEE and CIIRCCzech Technical University in PraguePragueCzechia
  3. 3.Department of Computer Science and DIMAPUniversity of WarwickCoventryUK
  4. 4.Department of Econometrics and Operations ResearchVrije UniversiteitAmsterdamThe Netherlands
  5. 5.Department of Industrial EngineeringUniversity of Santiago of ChileSantiagoChile
  6. 6.Department of Computer ScienceRWTH Aachen UniversityAachenGermany

Personalised recommendations