SciELO - Scientific Electronic Library Online

 
vol.7 issue3Contributions of Jayme Luiz Szwarcfiter to graph theory and computer scienceRamsey minimal graphs author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

Share


Journal of the Brazilian Computer Society

Print version ISSN 0104-6500On-line version ISSN 1678-4804

Abstract

BLAZEWICZ, Jacek; ECKER, Klaus; KIS, Tamás  and  TANAS, Michal. A note on the complexity of scheduling coupled tasks on a single processor. J. Braz. Comp. Soc. [online]. 2001, vol.7, n.3, pp.23-26. ISSN 0104-6500.  http://dx.doi.org/10.1590/S0104-65002001000200004.

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 : Scheduling; coupled tasks; NP-hardness.

        · text in English     · English ( pdf epdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License