Minimizing flowtime subject to optimal makespan on two identical parallel machines
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). Util...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
2000-06-01
|
Series: | Pesquisa Operacional |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003 |
id |
doaj-dcdcbf3d0df2408ab84f88e8a5a2b606 |
---|---|
record_format |
Article |
spelling |
doaj-dcdcbf3d0df2408ab84f88e8a5a2b6062020-11-25T02:19:44ZengSociedade Brasileira de Pesquisa OperacionalPesquisa Operacional0101-74381678-51422000-06-01201051710.1590/S0101-74382000000100003Minimizing flowtime subject to optimal makespan on two identical parallel machinesJatinder N. D. GuptaJohnny C. HoWe 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.http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003Parallel machine schedulingHierarchical criteriaFlowtime minimization |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jatinder N. D. Gupta Johnny C. Ho |
spellingShingle |
Jatinder N. D. Gupta Johnny C. Ho Minimizing flowtime subject to optimal makespan on two identical parallel machines Pesquisa Operacional Parallel machine scheduling Hierarchical criteria Flowtime minimization |
author_facet |
Jatinder N. D. Gupta Johnny C. Ho |
author_sort |
Jatinder N. D. Gupta |
title |
Minimizing flowtime subject to optimal makespan on two identical parallel machines |
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 |
publisher |
Sociedade Brasileira de Pesquisa Operacional |
series |
Pesquisa Operacional |
issn |
0101-7438 1678-5142 |
publishDate |
2000-06-01 |
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. |
topic |
Parallel machine scheduling Hierarchical criteria Flowtime minimization |
url |
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100003 |
work_keys_str_mv |
AT jatinderndgupta minimizingflowtimesubjecttooptimalmakespanontwoidenticalparallelmachines AT johnnycho minimizingflowtimesubjecttooptimalmakespanontwoidenticalparallelmachines |
_version_ |
1724874718287233024 |