A polynomial-time branching procedure for the multiprocessor scheduling problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 1996 |
Outros Autores: | |
Tipo de documento: | Relatório |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFRJ |
Texto Completo: | http://hdl.handle.net/11422/2594 |
Resumo: | In this paper, we present and analyze a branching procedure suitable for branchand-bound algorithms for solving multiprocessor scheduling problems. The originality of this branching procedure resides mainly in its ability to enumerate all feasible solutions without generating duplicated subproblems. This procedure is shown to be polynomial in time and space complexities. The main applications of such branching procedure are instances of the MSP where the costs are large because the height of the search tree is linear on the number of tasks to be scheduled. This in opposition to another branching procedure in the literature that generates a search tree whose height is porportional to the costs of the tasks. |
id |
UFRJ_7da74356e90f8b759d45b4be090581df |
---|---|
oai_identifier_str |
oai:pantheon.ufrj.br:11422/2594 |
network_acronym_str |
UFRJ |
network_name_str |
Repositório Institucional da UFRJ |
repository_id_str |
|
spelling |
Corrêa, Ricardo CordeiroFerreira, Afonso2017-08-04T13:09:54Z2023-11-30T03:02:13Z1996-12-31CORRÊA, R. C.; FERREIRA, A. A polynomial-time branching procedure for the multiprocessor scheduling problem. Rio de Janeiro: NCE, UFRJ, 1996. 31 p. (Relatório Técnico, 04/96)http://hdl.handle.net/11422/2594In this paper, we present and analyze a branching procedure suitable for branchand-bound algorithms for solving multiprocessor scheduling problems. The originality of this branching procedure resides mainly in its ability to enumerate all feasible solutions without generating duplicated subproblems. This procedure is shown to be polynomial in time and space complexities. The main applications of such branching procedure are instances of the MSP where the costs are large because the height of the search tree is linear on the number of tasks to be scheduled. This in opposition to another branching procedure in the literature that generates a search tree whose height is porportional to the costs of the tasks.Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:09:54Z No. of bitstreams: 1 04_96.pdf: 1687112 bytes, checksum: 690a20c810110c7961c70d0b9e1029d6 (MD5)Made available in DSpace on 2017-08-04T13:09:54Z (GMT). No. of bitstreams: 1 04_96.pdf: 1687112 bytes, checksum: 690a20c810110c7961c70d0b9e1029d6 (MD5) Previous issue date: 1996-12-31engRelatório Técnico NCECNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAOMultiplus multiprocessorEscalonamento multidimensionalA polynomial-time branching procedure for the multiprocessor scheduling probleminfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/report0496abertoBrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaisinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRJinstname:Universidade Federal do Rio de Janeiro (UFRJ)instacron:UFRJORIGINAL04_96.pdf04_96.pdfapplication/pdf1687112http://pantheon.ufrj.br:80/bitstream/11422/2594/1/04_96.pdf690a20c810110c7961c70d0b9e1029d6MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81853http://pantheon.ufrj.br:80/bitstream/11422/2594/2/license.txtdd32849f2bfb22da963c3aac6e26e255MD52TEXT04_96.pdf.txt04_96.pdf.txtExtracted texttext/plain38149http://pantheon.ufrj.br:80/bitstream/11422/2594/3/04_96.pdf.txt3da42ce65edcbd09182a0600348dbb6cMD5311422/25942023-11-30 00:02:13.933oai:pantheon.ufrj.br:11422/2594TElDRU7Dh0EgTsODTy1FWENMVVNJVkEgREUgRElTVFJJQlVJw4fDg08KCkFvIGFzc2luYXIgZSBlbnRyZWdhciBlc3RhIGxpY2Vuw6dhLCB2b2PDqihzKSBvKHMpIGF1dG9yKGVzKSBvdSBwcm9wcmlldMOhcmlvKHMpIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBjb25jZWRlKG0pIGFvIFJlcG9zaXTDs3JpbyBQYW50aGVvbiBkYSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gZGUgSmFuZWlybyAoVUZSSikgbyBkaXJlaXRvIG7Do28gLSBleGNsdXNpdm8gZGUgcmVwcm9kdXppciwgY29udmVydGVyIChjb21vIGRlZmluaWRvIGFiYWl4byksIGUvb3UgZGlzdHJpYnVpciBvIGRvY3VtZW50byBlbnRyZWd1ZSAoaW5jbHVpbmRvIG8gcmVzdW1vKSBlbSB0b2RvIG8gbXVuZG8sIGVtIGZvcm1hdG8gZWxldHLDtG5pY28gZSBlbSBxdWFscXVlciBtZWlvLCBpbmNsdWluZG8sIG1hcyBuw6NvIGxpbWl0YWRvIGEgw6F1ZGlvIGUvb3UgdsOtZGVvLgoKVm9jw6ogY29uY29yZGEgcXVlIGEgVUZSSiBwb2RlLCBzZW0gYWx0ZXJhciBvIGNvbnRlw7pkbywgdHJhZHV6aXIgYSBhcHJlc2VudGHDp8OjbyBkZSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gY29tIGEgZmluYWxpZGFkZSBkZSBwcmVzZXJ2YcOnw6NvLgoKVm9jw6ogdGFtYsOpbSBjb25jb3JkYSBxdWUgYSBVRlJKIHBvZGUgbWFudGVyIG1haXMgZGUgdW1hIGPDs3BpYSBkZXNzYSBzdWJtaXNzw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8OjbyBkaWdpdGFsLgoKRGVjbGFyYSBxdWUgbyBkb2N1bWVudG8gZW50cmVndWUgw6kgc2V1IHRyYWJhbGhvIG9yaWdpbmFsLCBlIHF1ZSB2b2PDqiB0ZW0gbyBkaXJlaXRvIGRlIGNvbmNlZGVyIG9zIGRpcmVpdG9zIGNvbnRpZG9zIG5lc3RhIGxpY2Vuw6dhLiBWb2PDqiB0YW1iw6ltIGRlY2xhcmEgcXVlIGEgc3VhIGFwcmVzZW50YcOnw6NvLCBjb20gbyBtZWxob3IgZGUgc2V1cyBjb25oZWNpbWVudG9zLCBuw6NvIGluZnJpbmdpIGRpcmVpdG9zIGF1dG9yYWlzIGRlIHRlcmNlaXJvcy4KClNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCB2b2PDqiBuw6NvIHRlbSBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBlIGNvbmNlZGUgYSBVRlJKIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvIGRhIHN1Ym1pc3PDo28uCgpTZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBiYXNlYWRvIGVtIHRyYWJhbGhvIHF1ZSBmb2ksIG91IHRlbSBzaWRvIHBhdHJvY2luYWRvIG91IGFwb2lhZG8gcG9yIHVtYSBhZ8OqbmNpYSBvdSBvdXRybyhzKSBvcmdhbmlzbW8ocykgcXVlIG7Do28gYSBVRlJKLCB2b2PDqiBkZWNsYXJhIHF1ZSBjdW1wcml1IHF1YWxxdWVyIGRpcmVpdG8gZGUgUkVWSVPDg08gb3UgZGUgb3V0cmFzIG9icmlnYcOnw7VlcyByZXF1ZXJpZGFzIHBvciBjb250cmF0byBvdSBhY29yZG8uCgpBIFVGUkogaXLDoSBpZGVudGlmaWNhciBjbGFyYW1lbnRlIG8ocykgc2V1KHMpIG5vbWUocykgY29tbyBhdXRvcihlcykgb3UgcHJvcHJpZXTDoXJpbyhzKSBkYSBzdWJtaXNzw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIHBhcmEgYWzDqW0gZGFzIHBlcm1pdGlkYXMgcG9yIGVzdGEgbGljZW7Dp2EsIG5vIGF0byBkZSBzdWJtaXNzw6NvLgo=Repositório de PublicaçõesPUBhttp://www.pantheon.ufrj.br/oai/requestopendoar:2023-11-30T03:02:13Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)false |
dc.title.en.fl_str_mv |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
title |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
spellingShingle |
A polynomial-time branching procedure for the multiprocessor scheduling problem Corrêa, Ricardo Cordeiro CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO Multiplus multiprocessor Escalonamento multidimensional |
title_short |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
title_full |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
title_fullStr |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
title_full_unstemmed |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
title_sort |
A polynomial-time branching procedure for the multiprocessor scheduling problem |
author |
Corrêa, Ricardo Cordeiro |
author_facet |
Corrêa, Ricardo Cordeiro Ferreira, Afonso |
author_role |
author |
author2 |
Ferreira, Afonso |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Corrêa, Ricardo Cordeiro Ferreira, Afonso |
dc.subject.cnpq.fl_str_mv |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO |
topic |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO Multiplus multiprocessor Escalonamento multidimensional |
dc.subject.por.fl_str_mv |
Multiplus multiprocessor Escalonamento multidimensional |
description |
In this paper, we present and analyze a branching procedure suitable for branchand-bound algorithms for solving multiprocessor scheduling problems. The originality of this branching procedure resides mainly in its ability to enumerate all feasible solutions without generating duplicated subproblems. This procedure is shown to be polynomial in time and space complexities. The main applications of such branching procedure are instances of the MSP where the costs are large because the height of the search tree is linear on the number of tasks to be scheduled. This in opposition to another branching procedure in the literature that generates a search tree whose height is porportional to the costs of the tasks. |
publishDate |
1996 |
dc.date.issued.fl_str_mv |
1996-12-31 |
dc.date.accessioned.fl_str_mv |
2017-08-04T13:09:54Z |
dc.date.available.fl_str_mv |
2023-11-30T03:02:13Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/report |
format |
report |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
CORRÊA, R. C.; FERREIRA, A. A polynomial-time branching procedure for the multiprocessor scheduling problem. Rio de Janeiro: NCE, UFRJ, 1996. 31 p. (Relatório Técnico, 04/96) |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11422/2594 |
identifier_str_mv |
CORRÊA, R. C.; FERREIRA, A. A polynomial-time branching procedure for the multiprocessor scheduling problem. Rio de Janeiro: NCE, UFRJ, 1996. 31 p. (Relatório Técnico, 04/96) |
url |
http://hdl.handle.net/11422/2594 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartof.pt_BR.fl_str_mv |
Relatório Técnico NCE |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.country.fl_str_mv |
Brasil |
dc.publisher.department.fl_str_mv |
Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFRJ instname:Universidade Federal do Rio de Janeiro (UFRJ) instacron:UFRJ |
instname_str |
Universidade Federal do Rio de Janeiro (UFRJ) |
instacron_str |
UFRJ |
institution |
UFRJ |
reponame_str |
Repositório Institucional da UFRJ |
collection |
Repositório Institucional da UFRJ |
bitstream.url.fl_str_mv |
http://pantheon.ufrj.br:80/bitstream/11422/2594/1/04_96.pdf http://pantheon.ufrj.br:80/bitstream/11422/2594/2/license.txt http://pantheon.ufrj.br:80/bitstream/11422/2594/3/04_96.pdf.txt |
bitstream.checksum.fl_str_mv |
690a20c810110c7961c70d0b9e1029d6 dd32849f2bfb22da963c3aac6e26e255 3da42ce65edcbd09182a0600348dbb6c |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ) |
repository.mail.fl_str_mv |
|
_version_ |
1784097091457384448 |