Minimizing flowtime subject to optimal makespan on two identical parallel machines

Detalhes bibliográficos
Autor(a) principal: Gupta,Jatinder N. D.
Data de Publicação: 2000
Outros Autores: Ho,Johnny C.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003
Resumo: We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all jobs) among the set of schedules with optimal makespan (the completion time of the latest job). Utilizing an existing optimization algorithm for the minimization of makespan, we propose an algorithm to determine optimal schedules for this problem. We empirically show that the proposed algorithm can quickly find optimal schedules for problems containing a large number of jobs.
id SOBRAPO-1_f4db79815ddadc58a1f5f3b384f6d8ac
oai_identifier_str oai:scielo:S0101-74382000000100003
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Minimizing flowtime subject to optimal makespan on two identical parallel machinesParallel machine schedulingHierarchical criteriaFlowtime minimizationWe consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all jobs) among the set of schedules with optimal makespan (the completion time of the latest job). Utilizing an existing optimization algorithm for the minimization of makespan, we propose an algorithm to determine optimal schedules for this problem. We empirically show that the proposed algorithm can quickly find optimal schedules for problems containing a large number of jobs.Sociedade Brasileira de Pesquisa Operacional2000-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003Pesquisa Operacional v.20 n.1 2000reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382000000100003info:eu-repo/semantics/openAccessGupta,Jatinder N. D.Ho,Johnny C.eng2003-05-27T00:00:00Zoai:scielo:S0101-74382000000100003Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2003-05-27T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Minimizing flowtime subject to optimal makespan on two identical parallel machines
title Minimizing flowtime subject to optimal makespan on two identical parallel machines
spellingShingle Minimizing flowtime subject to optimal makespan on two identical parallel machines
Gupta,Jatinder N. D.
Parallel machine scheduling
Hierarchical criteria
Flowtime minimization
title_short Minimizing flowtime subject to optimal makespan on two identical parallel machines
title_full Minimizing flowtime subject to optimal makespan on two identical parallel machines
title_fullStr Minimizing flowtime subject to optimal makespan on two identical parallel machines
title_full_unstemmed Minimizing flowtime subject to optimal makespan on two identical parallel machines
title_sort Minimizing flowtime subject to optimal makespan on two identical parallel machines
author Gupta,Jatinder N. D.
author_facet Gupta,Jatinder N. D.
Ho,Johnny C.
author_role author
author2 Ho,Johnny C.
author2_role author
dc.contributor.author.fl_str_mv Gupta,Jatinder N. D.
Ho,Johnny C.
dc.subject.por.fl_str_mv Parallel machine scheduling
Hierarchical criteria
Flowtime minimization
topic Parallel machine scheduling
Hierarchical criteria
Flowtime minimization
description We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all jobs) among the set of schedules with optimal makespan (the completion time of the latest job). Utilizing an existing optimization algorithm for the minimization of makespan, we propose an algorithm to determine optimal schedules for this problem. We empirically show that the proposed algorithm can quickly find optimal schedules for problems containing a large number of jobs.
publishDate 2000
dc.date.none.fl_str_mv 2000-06-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=S0101-74382000000100003
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382000000100003
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 Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.20 n.1 2000
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318016162168832

Registros relacionados