A note on the complexity of scheduling coupled tasks on a single processor

Jacek Błazewicz, Klaus Ecker, Tamás Kis, Michał Tanaś

Research output: Contribution to journalArticle

5 Citations (Scopus)


This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion is to minimise the schedule length. This problem is introduced e.g. in systems controlling radar operations. We show that the general problem is NP-hard.

Original languageEnglish
Pages (from-to)23-26
Number of pages4
JournalJournal of the Brazilian Computer Society
Issue number3
Publication statusPublished - Jan 1 2001



  • Coupled tasks
  • NP-hardness
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this