Scheduling of coupled tasks with unit processing times

J. Blazewicz, K. Ecker, T. Kis, C. N. Potts, M. Tanas, J. Whitehead

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The coupled tasks scheduling problem was originally introduced for modeling complex radar devices. It is still used for controlling such devices and applied in similar applications. This paper considers a problem of coupled tasks scheduling on a single processor, under the assumptions that all processing times are equal to 1, the gap has exact integer length L and the precedence constraints are strict. We prove that the general problem, when L is part of the input and the precedence constraints graph is a general graph, is NP-hard in the strong sense.We also show that the special case when L = 2 and the precedence constraints graph is an in-tree or an out-tree, can be solved in O(n) time.

Original languageEnglish
Pages (from-to)453-461
Number of pages9
JournalJournal of Scheduling
Volume13
Issue number5
DOIs
Publication statusPublished - Oct 2010

Keywords

  • Complexity
  • Coupled tasks
  • Exact gap
  • Scheduling

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Scheduling of coupled tasks with unit processing times'. Together they form a unique fingerprint.

  • Cite this

    Blazewicz, J., Ecker, K., Kis, T., Potts, C. N., Tanas, M., & Whitehead, J. (2010). Scheduling of coupled tasks with unit processing times. Journal of Scheduling, 13(5), 453-461. https://doi.org/10.1007/s10951-010-0167-z