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

Jacek Błazewicz, Klaus Ecker, T. Kis, Michał Tanaś

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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
Volume7
Issue number3
Publication statusPublished - 2001

Fingerprint

Radar systems
Computational complexity
Scheduling
Processing

Keywords

  • Coupled tasks
  • NP-hardness
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

A note on the complexity of scheduling coupled tasks on a single processor. / Błazewicz, Jacek; Ecker, Klaus; Kis, T.; Tanaś, Michał.

In: Journal of the Brazilian Computer Society, Vol. 7, No. 3, 2001, p. 23-26.

Research output: Contribution to journalArticle

Błazewicz, Jacek ; Ecker, Klaus ; Kis, T. ; Tanaś, Michał. / A note on the complexity of scheduling coupled tasks on a single processor. In: Journal of the Brazilian Computer Society. 2001 ; Vol. 7, No. 3. pp. 23-26.
@article{d312e924f40a462f8081c17587d1c218,
title = "A note on the complexity of scheduling coupled tasks on a single processor",
abstract = "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.",
keywords = "Coupled tasks, NP-hardness, Scheduling",
author = "Jacek Błazewicz and Klaus Ecker and T. Kis and Michał Tanaś",
year = "2001",
language = "English",
volume = "7",
pages = "23--26",
journal = "Journal of the Brazilian Computer Society",
issn = "0104-6500",
publisher = "Sociedade Brasileira de Computacao",
number = "3",

}

TY - JOUR

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

AU - Błazewicz, Jacek

AU - Ecker, Klaus

AU - Kis, T.

AU - Tanaś, Michał

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Coupled tasks

KW - NP-hardness

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=52549087344&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52549087344&partnerID=8YFLogxK

M3 - Article

VL - 7

SP - 23

EP - 26

JO - Journal of the Brazilian Computer Society

JF - Journal of the Brazilian Computer Society

SN - 0104-6500

IS - 3

ER -