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

Detalhes bibliográficos
Autor(a) principal: Blazewicz,Jacek
Data de Publicação: 2001
Outros Autores: Ecker,Klaus, Kis,Tamás, Tanas,Michal
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Journal of the Brazilian Computer Society
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200004
Resumo: 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.
id UFRGS-28_b6c95e57f739aadbd769b429d5165fba
oai_identifier_str oai:scielo:S0104-65002001000200004
network_acronym_str UFRGS-28
network_name_str Journal of the Brazilian Computer Society
repository_id_str
spelling A note on the complexity of scheduling coupled tasks on a single processorSchedulingcoupled tasksNP-hardnessThis 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.Sociedade Brasileira de Computação2001-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200004Journal of the Brazilian Computer Society v.7 n.3 2001reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002001000200004info:eu-repo/semantics/openAccessBlazewicz,JacekEcker,KlausKis,TamásTanas,Michaleng2003-12-16T00:00:00Zoai:scielo:S0104-65002001000200004Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2003-12-16T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false
dc.title.none.fl_str_mv A note on the complexity of scheduling coupled tasks on a single processor
title A note on the complexity of scheduling coupled tasks on a single processor
spellingShingle A note on the complexity of scheduling coupled tasks on a single processor
Blazewicz,Jacek
Scheduling
coupled tasks
NP-hardness
title_short A note on the complexity of scheduling coupled tasks on a single processor
title_full A note on the complexity of scheduling coupled tasks on a single processor
title_fullStr A note on the complexity of scheduling coupled tasks on a single processor
title_full_unstemmed A note on the complexity of scheduling coupled tasks on a single processor
title_sort A note on the complexity of scheduling coupled tasks on a single processor
author Blazewicz,Jacek
author_facet Blazewicz,Jacek
Ecker,Klaus
Kis,Tamás
Tanas,Michal
author_role author
author2 Ecker,Klaus
Kis,Tamás
Tanas,Michal
author2_role author
author
author
dc.contributor.author.fl_str_mv Blazewicz,Jacek
Ecker,Klaus
Kis,Tamás
Tanas,Michal
dc.subject.por.fl_str_mv Scheduling
coupled tasks
NP-hardness
topic Scheduling
coupled tasks
NP-hardness
description 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.
publishDate 2001
dc.date.none.fl_str_mv 2001-01-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200004
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200004
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0104-65002001000200004
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv Journal of the Brazilian Computer Society v.7 n.3 2001
reponame:Journal of the Brazilian Computer Society
instname:Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
instname_str Sociedade Brasileira de Computação (SBC)
instacron_str UFRGS
institution UFRGS
reponame_str Journal of the Brazilian Computer Society
collection Journal of the Brazilian Computer Society
repository.name.fl_str_mv Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)
repository.mail.fl_str_mv jbcs@icmc.sc.usp.br
_version_ 1754734669563166720

Registros relacionados